A multi-objective differential evolutionary algorithm for constrained multi-objective optimization problems with low feasible ratio

被引:92
作者
Yang, Yongkuan [1 ,2 ]
Liu, Jianchang [1 ,2 ]
Tan, Shubin [1 ,2 ]
Wang, Honghai [1 ,2 ]
机构
[1] Northeastern Univ, Dept Informat Sci & Engn, Shenyang 110819, Liaoning, Peoples R China
[2] Northeastern Univ, State Key Lab Synthet Automat Proc Ind, Shenyang 110819, Liaoning, Peoples R China
基金
中国国家自然科学基金;
关键词
Constrained multi-objective optimization; Epsilon constraint handling method; Different evolution;
D O I
10.1016/j.asoc.2019.02.041
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most current evolutionary multi-objective optimization (EMO) algorithms perform well on multi-objective optimization problems without constraints, but they encounter difficulties in their ability for constrained multi-objective optimization problems (CMOPs) with low feasible ratio. To tackle this problem, this paper proposes a multi-objective differential evolutionary algorithm named MODE-SaE based on an improved epsilon constraint-handling method. Firstly, MODE-SaE self-adaptively adjusts the epsilon level in line with the maximum and minimum constraint violation values of infeasible individuals. It can prevent epsilon level setting from being unreasonable. Then, the feasible solutions are saved to the external archive and take part in the population evolution by a co-evolution strategy. Finally, MODE-SaE switches the global search and local search by self-switching parameters of search engine to balance the convergence and distribution. With the aim of evaluating the performance of MODE-SaE, a real-world problem with low feasible ratio in decision space and fourteen bench-mark test problems, are used to test MODE-SaE and five other state-of-the-art constrained multi-objective evolution algorithms. The experimental results fully demonstrate the superiority of MODE-SaE on all mentioned test problems, which indicates the effectiveness of the proposed algorithm for CMOPs which have low feasible ratio in search space. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:42 / 56
页数:15
相关论文
共 35 条
[1]   Reduced-Cost Constrained Miniaturization of Wideband Antennas Using Improved Trust-Region Gradient Search With Repair Step [J].
Bekasiewicz, Adrian ;
Koziel, Slawomir ;
Cheng, Qingsha S. .
IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS, 2018, 17 (04) :559-562
[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 Evolutionary Programming Algorithm and Its Applications to Power Generation Expansion Planning [J].
Ceciliano Meza, Jose L. ;
Yildirim, Mehmet Bayram ;
Masud, Abu S. M. .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2009, 39 (05) :1086-1096
[4]   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
[5]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[6]   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
[7]  
Deb K, 2001, WIL INT S SYS OPT
[8]   A multi-objective optimization model for gas pipeline operations [J].
Demissie, Alem ;
Zhu, Weihang ;
Belachew, Chanyalew Taye .
COMPUTERS & CHEMICAL ENGINEERING, 2017, 100 :94-103
[9]  
Fan Z., 2016, ARXIV161207603
[10]  
Fan Z, 2016, 2016 IEEE S SER COMP, P1