A Many-Objective Evolutionary Algorithm With Two Interacting Processes: Cascade Clustering and Reference Point Incremental Learning

被引:68
作者
Ge, Hongwei [1 ]
Zhao, Mingde [2 ]
Sun, Liang [1 ]
Wang, Zhen [3 ]
Tan, Guozhen [1 ]
Zhang, Qiang [1 ]
Chen, C. L. Philip [4 ]
机构
[1] Dalian Univ Technol, Coll Comp Sci & Technol, Dalian 116023, Peoples R China
[2] McGill Univ, Sch Comp Sci, Montreal, PQ H3A 0E9, Canada
[3] Dalian Univ Technol, Sch Math Sci, Dalian 116023, Peoples R China
[4] Univ Macau, Dept Comp & Informat Sci, Macau 999078, Peoples R China
基金
中国国家自然科学基金;
关键词
Clustering; incremental machine learning; interacting processes; many-objective optimization; reference vector; NONDOMINATED SORTING APPROACH; RANKING METHOD; OPTIMIZATION; DECOMPOSITION; MOEA/D; PERFORMANCE; ADAPTATION; DIVERSITY; INDICATOR;
D O I
10.1109/TEVC.2018.2874465
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Researches have shown difficulties in obtaining proximity while maintaining diversity for many-objective optimization problems. Complexities of the true Pareto front pose challenges for the reference vector-based algorithms for their insufficient adaptability to the diverse characteristics with no priori. This paper proposes a many-objective optimization algorithm with two interacting processes: cascade clustering and reference point incremental learning (CLIA). In the population selection process based on cascade clustering (CC), using the reference vectors provided by the process based on incremental learning, the nondominated and the dominated individuals are clustered and sorted with different manners in a cascade style and are selected by round-robin for better proximity and diversity. In the reference vector adaptation process based on reference point incremental learning, using the feedbacks from the process based on CC, proper distribution of reference points is gradually obtained by incremental learning. Experimental studies on several benchmark problems show that CLIA is competitive compared with the state-of-the-art algorithms and has impressive efficiency and versatility using only the interactions between the two processes without incurring extra evaluations.
引用
收藏
页码:572 / 586
页数:15
相关论文
共 57 条
[1]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[2]   An improved NSGA-III algorithm based on objective space decomposition for many-objective optimization [J].
Bi, Xiaojun ;
Wang, Chao .
SOFT COMPUTING, 2017, 21 (15) :4269-4296
[3]   A clustering-ranking method for many-objective optimization [J].
Cai, Lei ;
Qu, Shiru ;
Yuan, Yuan ;
Yao, Xin .
APPLIED SOFT COMPUTING, 2015, 35 :681-694
[4]   Training a support vector machine in the primal [J].
Chapelle, Olivier .
NEURAL COMPUTATION, 2007, 19 (05) :1155-1178
[5]  
Cheng R, 2017, Rep.
[6]   Evolutionary Many-Objective Optimization of Hybrid Electric Vehicle Control: From General Optimization to Preference Articulation [J].
Cheng, Ran ;
Rodemann, Tobias ;
Fischer, Michael ;
Olhofer, Markus ;
Jin, Yaochu .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2017, 1 (02) :97-111
[7]   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
[8]   A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization [J].
Chugh, Tinkle ;
Jin, Yaochu ;
Miettinen, Kaisa ;
Hakanen, Jussi ;
Sindhya, Karthik .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (01) :129-142
[9]  
Dai C, 2016, SOFT COMPUT, V20, P1105, DOI 10.1007/s00500-014-1570-8
[10]   Indicator and reference points co-guided evolutionary algorithm for many-objective optimization problems [J].
Dai, Guangming ;
Zhou, Chong ;
Wang, Maocai ;
Li, Xiangping .
KNOWLEDGE-BASED SYSTEMS, 2018, 140 :50-63