A Localized High-Fidelity-Dominance-Based Many-Objective Evolutionary Algorithm

被引:8
作者
Saxena, Dhish Kumar [1 ]
Mittal, Sukrit [1 ]
Kapoor, Sarang [2 ]
Deb, Kalyanmoy [3 ,4 ]
机构
[1] Indian Inst Technol Roorkee, Dept Mech & Ind Engn, Roorkee, India
[2] Indian Inst Technol Roorkee, Dept Comp Sci & Engn, Roorkee, India
[3] Michigan State Univ, Beacon Ctr Study Evolut Act, E Lansing, MI USA
[4] Michigan State Univ, Dept Elect & Comp Engn, E Lansing, MI USA
关键词
Localized high-fidelity dominance; many objective; Nadir point update; self termination; NONDOMINATED SORTING APPROACH; OPTIMIZATION; PERFORMANCE; MOEA/D;
D O I
10.1109/TEVC.2022.3188064
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The practicality of Pareto-dominance in solving many-objective optimization problems becomes questionable due to its inability to factor the critical human decision-making (HDM) elements, including the number of better objectives, the degree of betterment in objectives, and objectives' relative preference. Relevant dominance principles are recently proposed to incorporate the first two HDM elements, often with the need for new tunable parameters. This article proposes a high-fidelity-dominance principle that factors all the three HDM elements, explicitly and simultaneously, and without requiring tuning of any parameter. This principle has been implemented in a reference-vector-based framework, leading to a computationally efficient many-objective evolutionary algorithm (MaOEA), namely, localized high-fidelity-dominance-based EA (LHFiD). Critically, LHFiD also has an inbuilt mechanism for on-the-fly determination of the timing for: 1) intermittent Nadir point estimation that enables faster convergence and 2) its self-termination that bears practically utility. This article is based on an extensive study involving 41 912 experiments, in which the proposed LHFiD approach is compared with the existing competitive MaOEAs. This article reports statistically better performance in about 60% instances, making it practical and worthy of further investigation and application.
引用
收藏
页码:923 / 937
页数:15
相关论文
共 61 条
[1]  
Abdi H, 2007, ENCY MEASUREMENT STA, V3, P103, DOI [DOI 10.4135/9781412952644, 10.4135/9781412952644]
[2]   Diversity Management in Evolutionary Many-Objective Optimization [J].
Adra, Salem F. ;
Fleming, Peter J. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (02) :183-195
[3]  
[Anonymous], 2006, P IEEE C EV COMP
[4]   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
[5]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[6]  
Batista LS, 2011, LECT NOTES COMPUT SC, V6576, P76, DOI 10.1007/978-3-642-19893-9_6
[7]   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
[8]   Pymoo: Multi-Objective Optimization in Python']Python [J].
Blank, Julian ;
Deb, Kalyanmoy .
IEEE ACCESS, 2020, 8 :89497-89509
[9]   Evolutionary Many-Objective Algorithm Using Decomposition-Based Dominance Relationship [J].
Chen, Lei ;
Liu, Hai-Lin ;
Tan, Kay Chen ;
Cheung, Yiu-Ming ;
Wang, Yuping .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (12) :4129-4139
[10]   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