Efficient Nondomination Level Update Method for Steady-State Evolutionary Multiobjective Optimization

被引:50
作者
Li, Ke [1 ,2 ]
Deb, Kalyanmoy [3 ]
Zhang, Qingfu [4 ]
Zhang, Qiang [5 ]
机构
[1] Univ Birmingham, Sch Comp Sci, CERCIA, Birmingham B15 2TT, W Midlands, England
[2] Univ Exeter, Coll Engn Math & Phys Sci, Exeter EX4 4QF, Devon, England
[3] Michigan State Univ, Dept Elect & Comp Engn, E Lansing, MI 48824 USA
[4] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[5] Sapienza Univ Rome, I-00185 Rome, Italy
基金
中国国家自然科学基金; 英国工程与自然科学研究理事会;
关键词
Computational complexity; nondominated sorting (NDS); nondomination level (NDL); Pareto dominance; steady-state evolutionary multiobjective optimization (EMO); GENETIC ALGORITHM; SELECTION; SORT;
D O I
10.1109/TCYB.2016.2621008
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nondominated sorting (NDS), which divides a population into several nondomination levels (NDLs), is a basic step in many evolutionary multiobjective optimization (EMO) algorithms. It has been widely studied in a generational evolution model, where the environmental selection is performed after generating a whole population of offspring. However, in a steady-state evolution model, where a population is updated right after the generation of a new candidate, the NDS can be extremely time consuming. This is especially severe when the number of objectives and population size become large. In this paper, we propose an efficient NDL update method to reduce the cost for maintaining the NDL structure in steady-state EMO. Instead of performing the NDS from scratch, our method only updates the NDLs of a limited number of solutions by extracting the knowledge from the current NDL structure. Notice that our NDL update method is performed twice at each iteration. One is after the reproduction, the other is after the environmental selection. Extensive experiments fully demonstrate that, comparing to the other five state-of-the-art NDS methods, our proposed method avoids a significant amount of unnecessary comparisons, not only in the synthetic data sets, but also in some real optimization scenarios. Last but not least, we find that our proposed method is also useful for the generational evolution model.
引用
收藏
页码:2838 / 2849
页数:12
相关论文
共 27 条
[1]  
[Anonymous], 1994, COMPLEX SYST
[2]  
[Anonymous], P COMP 2015 GEN EV C
[3]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[4]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[5]   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
[6]   Fast Implementation of the Steady-State NSGA-II Algorithm for Two Dimensions Based on Incremental Non-Dominated Sorting [J].
Buzdalov, Maxim ;
Yakupov, Ilya ;
Stankevich, Andrey .
GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, :647-654
[7]   Evaluating the ε-domination based multi-objective evolutionary algorithm for a quick computation of pareto-optimal solutions [J].
Deb, K ;
Mohan, M ;
Mishra, S .
EVOLUTIONARY COMPUTATION, 2005, 13 (04) :501-525
[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, 2005, Scalable test problems for evolutionary multiobjective optimization, DOI [DOI 10.1007/1-84628-137-76, 10.1007/1-84628-137-7_6]
[10]   jMetal: A Java']Java framework for multi-objective optimization [J].
Durillo, Juan J. ;
Nebro, Antonio J. .
ADVANCES IN ENGINEERING SOFTWARE, 2011, 42 (10) :760-771