Hybrid driven strategy for constrained evolutionary multi-objective optimization

被引:17
作者
Feng, Xue [1 ]
Pan, Anqi [1 ]
Ren, Zhengyun [1 ]
Fan, Zhiping [1 ]
机构
[1] Donghua Univ, Sch Informat Sci & Technol, 2999 Renmin North Rd, Shanghai 201620, Peoples R China
基金
中国国家自然科学基金;
关键词
Evolutionary algorithm; Constrained multi-objective optimization; Large-infeasible-regions; Two-archive; Hybrid driven strategy; NONDOMINATED SORTING APPROACH; HANDLING METHOD; ALGORITHM; DECOMPOSITION; MOEA/D;
D O I
10.1016/j.ins.2021.11.062
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the constrained multi-objective optimization problems, the pursuit of feasibility could improve convergence but will lead to the loss of diversity. For optimization algorithm, balancing the weight between convergence and diversity dynamically is a challenge, especially in problems with low proportion of feasible regions. In this paper, a constrained multi-objective optimization algorithm is proposed based on a hybrid driven strategy to enhance both the feasibility and diversity performance of the approximate Pareto solutions. The proposed algorithm contains two archives, that one is driven by feasibility information and the other is driven by diversity information. A self-adaptive archive selection mechanism and a conditional tournament selection strategy are proposed to provide mating parent solutions according to the evolutionary stage. Moreover, in the update of the feasibility archive, an evolutionary direction prediction mechanism is proposed and adopted to improve the evolutionary efficiency. Compared to four other multi-objective algorithms on three benchmark suits of different types, the performance of the proposed algorithm is better than the peer algorithms, especially in large-infeasible-regions multi objective optimization problems. (c) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页码:344 / 365
页数:22
相关论文
共 50 条
[1]   A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization [J].
Asafuddoula, M. ;
Ray, Tapabrata ;
Sarker, Ruhul .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (03) :445-460
[2]   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
[3]   A many-objective optimization recommendation algorithm based on knowledge mining [J].
Cai, Xingjuan ;
Hu, Zhaoming ;
Chen, Jinjun .
INFORMATION SCIENCES, 2020, 537 :148-161
[4]   A Constrained Decomposition Approach With Grids for Evolutionary Multiobjective Optimization [J].
Cai, Xinye ;
Mei, Zhiwei ;
Fan, Zhun ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (04) :564-577
[5]   A multiobjective optimization-based evolutionary algorithm for constrained optimization [J].
Cai, Zixing ;
Wang, Yong .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) :658-675
[6]   DMOEA-εC: Decomposition-Based Multiobjective Evolutionary Algorithm With the ε-Constraint Framework [J].
Chen, Jie ;
Li, Juan ;
Xin, Bin .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (05) :714-730
[7]   Solving multiobjective optimization problems using an artificial immune system [J].
Coello C.A.C. ;
Cortés N.C. .
Genetic Programming and Evolvable Machines, 2005, 6 (2) :163-190
[8]   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
[9]  
Deb K., 1995, Complex Systems, V9, P115
[10]  
Deb K, 1996, Comput Sci Inf, V26, P30, DOI DOI 10.1007/978-3-662-03423-127