Large-Scale Evolutionary Multiobjective Optimization Assisted by Directed Sampling

被引:108
作者
Qin, Shufen [1 ]
Sun, Chaoli [2 ]
Jin, Yaochu [3 ]
Tan, Ying [2 ]
Fieldsend, Jonathan [4 ]
机构
[1] Taiyuan Univ Sci & Technol, Sch Elect Informat Engn, Taiyuan 030024, Peoples R China
[2] Taiyuan Univ Sci & Technol, Dept Comp Sci & Technol, Taiyuan 030024, Peoples R China
[3] Univ Surrey, Dept Comp Sci, Guildford GU2 7XH, Surrey, England
[4] Univ Exeter, Dept Comp Sci, Exeter EX4 4QF, Devon, England
基金
中国国家自然科学基金; 山西省青年科学基金;
关键词
Optimization; Statistics; Sociology; Search problems; Convergence; Sorting; Computer science; Directed sampling (DS); evolutionary multiobjective optimization; large-scale multiobjective problems (LSMOPs); nondominated sorting; reference vectors; GENETIC ALGORITHM; DECOMPOSITION; CONVERGENCE; SELECTION;
D O I
10.1109/TEVC.2021.3063606
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
It is particularly challenging for evolutionary algorithms to quickly converge to the Pareto front in large-scale multiobjective optimization. To tackle this problem, this article proposes a large-scale multiobjective evolutionary algorithm assisted by some selected individuals generated by directed sampling (DS). At each generation, a set of individuals closer to the ideal point is chosen for performing a DS in the decision space, and those nondominated ones of the sampled solutions are used to assist the reproduction to improve the convergence in evolutionary large-scale multiobjective optimization. In addition, elitist nondominated sorting is adopted complementarily for environmental selection with a reference vector-based method in order to maintain diversity of the population. Our experimental results show that the proposed algorithm is highly competitive on large-scale multiobjective optimization test problems with up to 5000 decision variables compared to five state-of-the-art multiobjective evolutionary algorithms.
引用
收藏
页码:724 / 738
页数:15
相关论文
共 85 条
[21]   An Orthogonal Evolutionary Algorithm With Learning Automata for Multiobjective Optimization [J].
Dai, Cai ;
Wang, Yuping ;
Ye, Miao ;
Xue, Xingsi ;
Liu, Hailin .
IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (12) :3306-3319
[22]   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
[23]  
Deb K., 1996, Comput. Sci. Inform., V26, P30
[24]  
Deb K., 2001, MULTIOBJECTIVE OPTIM
[25]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[26]  
Dufner J., 2013, STATISTIK MIT SAS STATISTIK MIT SAS
[27]   Multiobjective optimization of safety related systems: An application to short-term conflict alert [J].
Everson, RM ;
Fieldsend, JE .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (02) :187-198
[28]   A Similarity-Based Cooperative Co-Evolutionary Algorithm for Dynamic Interval Multiobjective Optimization Problems [J].
Gong, Dunwei ;
Xu, Biao ;
Zhang, Yong ;
Guo, Yinan ;
Yang, Shengxiang .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (01) :142-156
[29]   A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems [J].
Gong, Dunwei ;
Han, Yuyan ;
Sun, Jianyong .
KNOWLEDGE-BASED SYSTEMS, 2018, 148 :115-130
[30]   Evolutionary algorithms with preference polyhedron for interval multi-objective optimization problems [J].
Gong, Dunwei ;
Sun, Jing ;
Ji, Xinfang .
INFORMATION SCIENCES, 2013, 233 :141-161