Selection Strategy Based on Proper Pareto Optimality in Evolutionary Multi-objective Optimization

被引:0
作者
Li, Kai [1 ]
Lin, Kangnian [1 ]
Zheng, Ruihao [1 ]
Wang, Zhenkun [1 ]
机构
[1] Southern Univ Sci & Technol, Sch Syst Design & Intelligent Mfg, Shenzhen 518055, Peoples R China
来源
PARALLEL PROBLEM SOLVING FROM NATURE-PPSN XVIII, PT IV, PPSN 2024 | 2024年 / 15151卷
基金
中国国家自然科学基金;
关键词
Multi-objective optimization; Dominance-resistant solution; Evolutionary algorithm; Proper Pareto optimality; ALGORITHM; WELL;
D O I
10.1007/978-3-031-70085-9_1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
On the multi-objective optimization problems (MOP), the dominance-resistant solution (DRS) refers to the solution that has inferior objective values but is difficult to dominate by other solutions. Prior studies have affirmed that DRSs are prevalent across MOPs and difficult to eliminate, leading to substantial performance deterioration in many multi-objective evolutionary algorithms (MOEAs). In this paper, we propose a metric inspired by proper Pareto optimality and then develop a selection strategy based on this metric (SPP) to mitigate the negative impact of DRSs. Furthermore, we implement SPP on multi-objective evolutionary algorithm based on decomposition (MOEA/D) and call the new algorithm MOEA/D-SPP. Specifically, the algorithm employs the penalty-based boundary intersection method to scalarize the MOP. Subsequently, SPP is integrated into the environmental selection. The strategy measures and sorts a set of solutions such that DRSs can be identified and removed. Finally, weight vectors are adjusted, thereby enhancing the population diversity. In experimental studies, MOEA/D-SPP outperforms five state-of-the-art MOEAs on DRS-MOPs, demonstrating the promising application of SPP.
引用
收藏
页码:3 / 19
页数:17
相关论文
共 47 条
[1]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[2]  
Batista LS, 2011, IEEE C EVOL COMPUTAT, P2359
[3]  
Bellman R., 1958, Dynamic Programming, V1, P3
[4]   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
[5]  
Deb K, 2003, LECT NOTES COMPUT SC, V2632, P222
[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., 1996, Comput. Sci. Inform., V26, P30
[8]   Identifying Pareto Fronts Reliably Using a Multistage Reference-Vector-Based Framework [J].
Deb, Kalyanmoy ;
Lopes, Claudio Lucio do Val ;
Martins, Flavio Vinicius Cruzeiro ;
Wanner, Elizabeth Fialho .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2024, 28 (01) :252-266
[9]   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
[10]   An Investigation on Preference Order - Ranking Scheme for Multi Objective Evolutionary Optimisation [J].
di Perro, Francesco ;
Khu, Soon-Thiam ;
Savic, Dragan A. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2007, 11 (01) :17-45