A multi-population evolutionary algorithm with single-objective guide for many-objective optimization

被引:15
作者
Liu, Haitao [1 ,2 ]
Du, Wei [3 ]
Guo, Zhaoxia [1 ,4 ]
机构
[1] Sichuan Univ, Business Sch, Chengdu 610065, Sichuan, Peoples R China
[2] Natl Univ Singapore, Dept Ind Syst Engn, Singapore 119077, Singapore
[3] East China Univ Sci & Technol, Key Lab Adv Control & Optimizat Chem Proc, Shanghai 200237, Peoples R China
[4] Sichuan Univ, Soft Sci Inst, Chengdu 610064, Sichuan, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-population evolutionary algorithm; Single-objective guide; Many-objective optimization; DECOMPOSITION; PERFORMANCE; TIME;
D O I
10.1016/j.ins.2019.06.051
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper develops a multi-population evolutionary algorithm with single-objective guide to tackle many-objective optimization problems. It exploits the merits of both multiple populations and single-objective optimization to balance diversity and convergence of the evolution process. Specifically, the single-objective guide process helps to construct the better ideal point and reference points. A novel objective space partitioning mechanism is developed to transform a many-objective optimization problem into multiple subproblems, each of which is tackled by a subpopulation. A novel information sharing mechanism between subpopulations is proposed to balance diversity and convergence. Finally the subpopulations are merged together and deal with many-objective optimization problems to further enhance the convergence. We have compared the performance of the proposed algorithm with nine state-of-the-art algorithms on 85 test instances of 21 benchmark problems with up to 15 objectives. Experimental results show that the proposed algorithm has the superior performance in solving multi- and many-objective optimization problems. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:39 / 60
页数:22
相关论文
共 46 条
[1]   Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method [J].
Abu Arqub, Omar ;
AL-Smadi, Mohammed ;
Momani, Shaher ;
Hayat, Tasawar .
SOFT COMPUTING, 2016, 20 (08) :3283-3302
[2]  
[Anonymous], 2014, INF SCI, DOI DOI 10.1016/j.ins.2014.03.128
[3]  
[Anonymous], 2001, P 6 INT C PAR PROBL
[4]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[5]   Priority based ε dominance: A new measure in multiobjective optimization [J].
Bandyopadhyay, Sanghamitra ;
Chakraborty, Rudrasis ;
Maulik, Ujjwal .
INFORMATION SCIENCES, 2015, 305 :97-109
[6]   Parallelizing multi-objective evolutionary algorithms: Cone separation [J].
Branke, J ;
Schmeck, H ;
Deb, K ;
Reddy, M .
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, :1952-1957
[7]   A Multi-Objective Approach for Microgrid Scheduling [J].
Carpinelli, Guido ;
Mottola, Fabio ;
Proto, Daniela ;
Russo, Angela .
IEEE TRANSACTIONS ON SMART GRID, 2017, 8 (05) :2109-2118
[8]   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
[9]   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
[10]  
Deb K, 2004, ADV INFO KNOW PROC, P105