Guiding Evolutionary Multiobjective Optimization With Generic Front Modeling

被引:69
作者
Tian, Ye [1 ]
Zhang, Xingyi [2 ]
Cheng, Ran [3 ]
He, Cheng [3 ]
Jin, Yaochu [4 ,5 ]
机构
[1] Anhui Univ, Inst Phys Sci & Informat Technol, Hefei 230601, Peoples R China
[2] Anhui Univ, Sch Comp Sci & Technol, Inst Bioinspired Intelligence & Min Knowledge, Hefei 230039, Peoples R China
[3] Southern Univ Sci & Technol, Shenzhen Key Lab Computat Intelligence, Univ Key Lab Evolving Intelligent Syst Guangdong, Dept Comp Sci & Engn, Shenzhen 518055, Peoples R China
[4] Univ Surrey, Dept Comp Sci, Guildford GU2 7XH, Surrey, England
[5] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Shenzhen 518055, Peoples R China
基金
中国国家自然科学基金; 英国工程与自然科学研究理事会;
关键词
Optimization; Shape; Training; Computer science; Sociology; Statistics; Evolutionary computation; Evolutionary algorithm; fitness function; front modeling; multiobjective and many-objective optimization; NONDOMINATED SORTING APPROACH; REFERENCE-POINT; PARETO FRONT; ALGORITHM; MOEA/D; PERFORMANCE; SELECTION;
D O I
10.1109/TCYB.2018.2883914
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In evolutionary multiobjective optimization, the Pareto front (PF) is approximated by using a set of representative candidate solutions with good convergence and diversity. However, most existing multiobjective evolutionary algorithms (MOEAs) have general difficulty in the approximation of PFs with complicated geometries. To address this issue, we propose a generic front modeling method for evolutionary multiobjective optimization, where the shape of the nondominated front is estimated by training a generalized simplex model. On the basis of the estimated front, we further develop an MOEA, where both the mating selection and environmental selection are driven by the approximate nondominated fronts modeled during the optimization process. For performance assessment, the proposed algorithm is compared with several state-of-the-art evolutionary algorithms on a wide range of benchmark problems with various types of PFs and different numbers of objectives. Experimental results demonstrate that the proposed algorithm performs consistently on a variety of multiobjective optimization problems.
引用
收藏
页码:1106 / 1119
页数:14
相关论文
共 52 条
[1]   A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization [J].
Asafuddoula, M. ;
Ray, Tapabrata ;
Sarker, Ruhul .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (03) :445-460
[2]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[3]   SMS-EMOA: Multiobjective selection based on dominated hypervolume [J].
Beume, Nicola ;
Naujoks, Boris ;
Emmerich, Michael .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) :1653-1669
[4]   A benchmark test suite for evolutionary many-objective optimization [J].
Cheng, Ran ;
Li, Miqing ;
Tian, Ye ;
Zhang, Xingyi ;
Yang, Shengxiang ;
Jin, Yaochu ;
Yao, Xin .
COMPLEX & INTELLIGENT SYSTEMS, 2017, 3 (01) :67-81
[5]   Test Problems for Large-Scale Multiobjective and Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (12) :4108-4121
[6]   A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :773-791
[7]  
Deb K, 2004, ADV INFO KNOW PROC, P105
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]  
Deb K., 1996, A combined genetic adaptive search (GeneAS) for engineering design, V26, P30
[10]  
Deb K., 2001, Multi-objective evolutionary optimization for hardware