Many-Objective Brain Storm Optimization Algorithm

被引:8
作者
Wu, Yali [1 ,2 ]
Wang, Xinrui [1 ,2 ]
Fu, Yulong [1 ,2 ]
Li, Guoting [1 ,2 ]
机构
[1] Xian Univ Technol, Sch Automat & Informat Engn, Xian 710048, Peoples R China
[2] Shaanxi Prov Key Lab Complex Syst Control & Intel, Xian 710048, Peoples R China
关键词
Brain storm optimization; decision variable clustering method; decomposition strategy; reference point; many-objective optimization; EVOLUTIONARY ALGORITHM; MULTIOBJECTIVE OPTIMIZATION; DIVERSITY; DECOMPOSITION; SELECTION; CONVERGENCE; PROXIMITY; BALANCE; QUALITY; MOEA/D;
D O I
10.1109/ACCESS.2019.2960874
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, many evolutionary algorithms and population-based algorithms have been developed for solving many-objective optimization problems. Inspired by the human brainstorming conference, Brain Storming Optimization (BSO) algorithm was guided by the cluster centers and other individuals with probability, which can balance convergence and diversity greatly. In this paper, the authors propose a novel brain storm optimization algorithm for many-objective optimization problem. The algorithm adopts the decision variable clustering method to divides the variables into convergence-related variables and diversity-related variables. The decomposition strategy is designed to increases selection pressure for the convergence-related variables, while the reference points strategy is adopted for the diversity-related variables to update the population and increase the diversity. Experimental results show that the proposed many-objective brain storm optimization algorithm is a very promising algorithm for solving many-objective optimization problems.
引用
收藏
页码:186572 / 186586
页数:15
相关论文
共 56 条
[1]  
[Anonymous], 2016, ADV SWARM INTELL, DOI DOI 10.1007/978-3-319-41000-5_48
[2]  
[Anonymous], 2019, SOFT COMPUT, DOI DOI 10.1080/19371918.2019.1649226
[3]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[4]   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
[5]   The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[6]   On the Effects of Adding Objectives to Plateau Functions [J].
Brockhoff, Dimo ;
Friedrich, Tobias ;
Hebbinghaus, Nils ;
Klein, Christian ;
Neumann, Frank ;
Zitzler, Eckart .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (03) :591-603
[7]   An External Archive Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Combinatorial Optimization [J].
Cai, Xinye ;
Li, Yexing ;
Fan, Zhun ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (04) :508-523
[8]  
Chand S., 2015, SURV OPER RES MANAG, V20, P35, DOI [DOI 10.1016/J.SORMS.2015.08.001, DOI 10.1016/J.S0RMS.2015.08.001]
[9]   A benchmark test suite for evolutionary many-objective optimization [J].
Cheng, Ran ;
Li, Miqing ;
Tian, Ye ;
Zhang, Xingyi ;
Yang, Shengxiang ;
Jin, Yaochu ;
Yao, Xin .
COMPLEX & INTELLIGENT SYSTEMS, 2017, 3 (01) :67-81
[10]   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