Set-based many-objective optimization guided by a preferred region

被引:15
作者
Gong, Dunwei [1 ]
Sun, Fenglin [1 ]
Sun, Jing [2 ]
Sun, Xiaoyan [1 ]
机构
[1] China Univ Min & Technol, Sch Informat & Elect Engn, Xuzhou 221116, Jiangsu, Peoples R China
[2] Huai Hai Inst Technol, Coll Sci, Lianyungang 222005, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Many-objective optimization; Set-based evolution; Achievement scalarizing function; Preferred region; Pareto dominance on sets; ALGORITHM; MOEA/D;
D O I
10.1016/j.neucom.2016.09.081
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Set-based evolutionary optimization based on performance indicators is one of effective methods to solve many objective optimization problems. However, preference information of a high-dimensional objective space has not yet been fully used to guide the evolution of a population. In this paper, we propose a set-based many objective evolutionary algorithm guided by a preferred region. In the set-based evolution, the preferred region of a high-dimensional objective space is dynamically determined, a selection Strategy on sets by combining the Pareto dominance on sets with the above preferred region is designed, and the crossover operators on sets guided by the above preferred region are developed to produce a Pareto front with superior performances. The proposed method is applied to four benchmark many-objective optimization problems and a real-world engineering design optimization problem, and the experimental results empirically demonstrate its effectiveness.
引用
收藏
页码:241 / 255
页数:15
相关论文
共 37 条
[1]  
[Anonymous], 2006, Int J Comput Intell Res, DOI DOI 10.5019/J.IJCIR.2006.68
[2]  
[Anonymous], 2006, INT J COMPUT INTELL, DOI DOI 10.5019/J.IJCIR.2006.67
[3]  
Auger A., 2009, Genetic and Evolutionary Computation Conference (GECCO 2009), P555
[4]  
Bader J., 2010, NEW DEV MULTIPLE OBJ, P35, DOI DOI 10.1007/978-3-642-10354-4_3
[5]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[6]  
Bader J, 2009, LECT NOTES COMPUT SC, V5467, P140, DOI 10.1007/978-3-642-01020-0_15
[7]   Using reference points to update the archive of MOPSO algorithms in Many-Objective Optimization [J].
Britto, Andre ;
Pozo, Aurora .
NEUROCOMPUTING, 2014, 127 :78-87
[8]   Improved multi-objective particle swarm optimization with preference strategy for optimal DG integration into the distribution system [J].
Cheng, Shan ;
Chen, Min-You ;
Fleming, Peter J. .
NEUROCOMPUTING, 2015, 148 :23-29
[9]  
Cui Xun-Xue, 2001, Chinese Journal of Computers, V24, P979
[10]   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