A constrained multi-objective evolutionary strategy based on population state detection

被引:10
作者
Tang, Huanrong [1 ,2 ,3 ]
Yu, Fan [1 ,2 ,3 ]
Zou, Juan [1 ,2 ,3 ]
Yang, Shengxiang [1 ,5 ]
Zheng, Jinhua [1 ,2 ,3 ,4 ]
机构
[1] Xiangtan Univ, Key Lab Intelligent Comp & Informat Proc, Comp Sci Coll, Minist Educ, Xiangtan, Hunan, Peoples R China
[2] Univ Xiangtan, Sch Comp Sci, Xiangtan 411105, Peoples R China
[3] Univ Xiangtan, Sch Cyberspace Sci, Xiangtan 411105, Peoples R China
[4] Hunan Prov Key Lab Intelligent Informat Proc & Ap, Hengyang 421002, Peoples R China
[5] De Montfort Univ, Sch Comp Sci & Informat, Leicester LE1 9BH, Leics, England
基金
中国国家自然科学基金;
关键词
Constrained multi-objective optimization; Evolutionary algorithm; State detection; Constraint handling; Restart scheme; NONDOMINATED SORTING APPROACH; OPTIMIZATION PROBLEMS; HANDLING METHOD; ALGORITHM; MOEA/D; SELECTION;
D O I
10.1016/j.swevo.2021.100978
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The difficulty of solving constrained multi-objective optimization problems (CMOPs) using evolutionary algorithms is to balance constraint satisfaction and objective optimization while fully considering the diversity of the solution set. Many CMOPs with disconnected feasible subregions make it difficult for algorithms to search for all feasible nondominated solutions. To address these issues, we propose a population state detection strategy (PSDS) and a restart scheme to determine whether the environmental selection strategy needs to be changed based on the situation of population. When the population converges in the feasible region, the unconstrained environmental selection allows the population to cross the current feasible region. When the population converging outside the feasible region, all constraints will be considered in the environmental selection to select the population for the feasible region. In addition, the restart scheme will use reinitialization to make the population jump out of unprofitable iterations. The proposed algorithm enhances the search ability through the detection strategy and provides more diversity by reinitializing the population. The experimental results on four constraint test suites with various features have demonstrated that the proposed algorithm had better or competitive performance against other state-of-the-art constrained multi-objective algorithms.
引用
收藏
页数:15
相关论文
共 43 条
[1]   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
[2]   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
[3]   A multiobjective optimization-based evolutionary algorithm for constrained optimization [J].
Cai, Zixing ;
Wang, Yong .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) :658-675
[4]   A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling [J].
Chen, Jing-fang ;
Wang, Ling ;
Peng, Zhi-ping .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 50
[5]   A benchmark for equality constrained multi-objective optimization [J].
Cuate, Oliver ;
Uribe, Lourdes ;
Lara, Adriana ;
Schutze, Oliver .
SWARM AND EVOLUTIONARY COMPUTATION, 2020, 52
[6]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[7]   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
[8]  
Deb K., 1995, Complex Systems, V9, P115
[9]  
Deb K., 1996, Comput. Sci. Inform., V26, P30, DOI DOI 10.1109/TEVC.2007.895269
[10]   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