A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization

被引:326
作者
Asafuddoula, M. [1 ]
Ray, Tapabrata [1 ]
Sarker, Ruhul [1 ]
机构
[1] Univ New S Wales, Sch Engn & Informat Technol, Canberra, ACT 2612, Australia
基金
澳大利亚研究理事会;
关键词
Adaptive epsilon constraint handling; decomposition; evolutionary algorithm; many-objective optimization; DIMENSIONALITY REDUCTION; DESIGN; CONSTRAINTS; DIVERSITY; MOEA/D; PARETO;
D O I
10.1109/TEVC.2014.2339823
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Decomposition-based evolutionary algorithms have been quite successful in solving optimization problems involving two and three objectives. Recently, there have been some attempts to exploit the strengths of decomposition-based approaches to deal with many objective optimization problems. Performance of such approaches are largely dependent on three key factors: 1) means of reference point generation; 2) schemes to simultaneously deal with convergence and diversity; and 3) methods to associate solutions to reference directions. In this paper, we introduce a decomposition-based evolutionary algorithm wherein uniformly distributed reference points are generated via systematic sampling, balance between convergence and diversity is maintained using two independent distance measures, and a simple preemptive distance comparison scheme is used for association. In order to deal with constraints, an adaptive epsilon formulation is used. The performance of the algorithm is evaluated using standard benchmark problems, i.e., DTLZ1-DTLZ4 for 3, 5, 8, 10, and 15 objectives, WFG1-WFG9, the car side impact problem, the water resource management problem, and the constrained ten-objective general aviation aircraft design problem. Results of problems involving redundant objectives and disconnected Pareto fronts are also included in this paper to illustrate the capability of the algorithm. The study clearly highlights that the proposed algorithm is better or at par with recent reference direction-based approaches for many objective optimization.
引用
收藏
页码:445 / 460
页数:16
相关论文
共 48 条
[1]   Diversity Management in Evolutionary Many-Objective Optimization [J].
Adra, Salem F. ;
Fleming, Peter J. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (02) :183-195
[2]  
Aguirre H., 2009, P IEEE S COMP INT MU, P104
[3]  
[Anonymous], 2012, IEEE C EVOL COMPUTAT
[4]  
Asafuddoula M, 2013, LECT NOTES COMPUT SC, V7811, P413, DOI 10.1007/978-3-642-37140-0_32
[5]   Faster Hypervolume-Based Search Using Monte Carlo Sampling [J].
Bader, Johannes ;
Deb, Kalyanmoy ;
Zitzler, Eckart .
MULTIPLE CRITERIA DECISION MAKING FOR SUSTAINABLE ENERGY AND TRANSPORTATION SYSTEMS: PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON MULTIPLE CRITERIA DECISION MAKING, 2010, 634 :313-326
[6]   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
[7]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[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., 1995, Complex Systems, V9, P115
[10]  
Deb K., 2012, IEEE WORLD C COMP IN, P10