COARSE-EMOA: An indicator-based evolutionary algorithm for solving equality constrained multi-objective optimization problems

被引:21
作者
Garcia, Jesus L. Llano [1 ]
Monroy, Raul [1 ]
Hernandez, Victor Adrian Sosa [1 ]
Coello, Carlos A. Coello [2 ,3 ,4 ]
机构
[1] Tecnol Monterrey, Sch Sci & Engn, Av Lago Guadalupe Km 3-5, Atizapan De Zaragoza 52926, Edo Mexico, Mexico
[2] CINVESTAV IPN, Dept Comp Sci, Av IPN 2508, Mexico City 07300, DF, Mexico
[3] Basque Ctr Appl Math BCAM, Bilbao, Spain
[4] Ikerbasque, Bilbao, Spain
关键词
Multi-Objective optimization; Performance indicators; Constrained optimization; Evolutionary algorithms; DISTANCE;
D O I
10.1016/j.swevo.2021.100983
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many real-world applications involve dealing with several conflicting objectives which need to be optimized simultaneously. Moreover, these problems may require the consideration of limitations that restrict their decision variable space. Evolutionary Algorithms (EAs) are capable of tackling Multi-objective Optimization Problems (MOPs). However, these approaches struggle to accurately approximate a feasible solution when considering equality constraints as part of the problem due to the inability of EAs to find and keep solutions exactly at the constraint boundaries. Here, we present an indicator-based evolutionary multi-objective optimization algorithm (EMOA) for tackling Equality Constrained MOPs (ECMOPs). In our proposal, we adopt an artificially constructed reference set closely resembling the feasible Pareto front of an ECMOP to calculate the Inverted Generational Distance of a population, which is then used as a density estimator. An empirical study over a set of benchmark problems each of which contains at least one equality constraint was performed to test the capabilities of our proposed COnstrAined Reference SEt -EMOA (COARSE-EMOA). Our results are compared to those obtained by six other EMOAs. As will be shown, our proposed COARSE-EMOA can properly approximate a feasible solution by guiding the search through the use of an artificially constructed set that approximates the feasible Pareto front of a given problem.
引用
收藏
页数:15
相关论文
共 60 条
[21]  
Fan Z, 2017, IEEE C EVOL COMPUTAT, P209, DOI 10.1109/CEC.2017.7969315
[22]  
Fan Z, 2016, IEEE C EVOL COMPUTAT, P460, DOI 10.1109/CEC.2016.7743830
[23]  
Griva I., 2009, OTHER TITLES APPL MA, VSecond
[24]  
HANSEN M. P., 1998, Technical report
[25]   Choosing Mutation and Crossover Ratios for Genetic Algorithms-A Review with a New Dynamic Approach [J].
Hassanat, Ahmad ;
Almohammadi, Khalid ;
Alkafaween, Esra'a ;
Abunawas, Eman ;
Hammouri, Awni ;
Prasath, V. B. Surya .
INFORMATION, 2019, 10 (12)
[26]  
Hernandez V.A. Sosa, DIRECTED SEARCH METH, P281, DOI [10.1007/978- 3-319-44003-3_12, DOI 10.1007/978-3-319-44003-3_12]
[27]   CONSTRAINED OPTIMIZATION VIA GENETIC ALGORITHMS [J].
HOMAIFAR, A ;
QI, CX ;
LAI, SH .
SIMULATION, 1994, 62 (04) :242-253
[28]   Modified Distance Calculation in Generational Distance and Inverted Generational Distance [J].
Ishibuchi, Hisao ;
Masuda, Hiroyuki ;
Tanigaki, Yuki ;
Nojima, Yusuke .
EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PT II, 2015, 9019 :110-125
[29]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach [J].
Jain, Himanshu ;
Deb, Kalyanmoy .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :602-622
[30]   Handling Constrained Many-Objective Optimization Problems via Problem Transformation [J].
Jiao, Ruwang ;
Zeng, Sanyou ;
Li, Changhe ;
Yang, Shengxiang ;
Ong, Yew-Soon .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (10) :4834-4847