A dual-population-based evolutionary algorithm for multi-objective optimization problems with irregular Pareto fronts

被引:4
作者
Zhong, Xiaoyu [1 ]
Yao, Xiangjuan [1 ]
Gong, Dunwei [2 ]
Qiao, Kangjia [3 ]
Gan, Xingjia [4 ]
Li, Zhangxiao [1 ]
机构
[1] China Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
[2] Qingdao Univ Sci & Technol, Sch Informat Sci & Technol, Qingdao 266061, Shandong, Peoples R China
[3] Zhengzhou Univ, Sch Elect & Informat Engn, Zhengzhou 450001, Henan, Peoples R China
[4] Cent South Univ, Sch Automat, Changsha 410083, Hunan, Peoples R China
关键词
Decomposition; Multi-objective optimization; Coevolutionary; Individual exploitation; Weight vector adaptation; MANY-OBJECTIVE OPTIMIZATION; NONDOMINATED SORTING APPROACH;
D O I
10.1016/j.swevo.2024.101566
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
When solving multi-objective optimization problems (MOPs) with irregular Pareto fronts (e.g., disconnected, degenerated, inverted) via evolutionary algorithms, a critical issue is how to obtain a set of well-distributed Pareto optimal solutions. To remedy this issue, we propose a dual-population-based evolutionary algorithm with individual exploitation and weight vector adaptation, named DPEA-IEAW. Specifically, the two populations, termed globPop and locPop, , individually evolve by decomposition-based and Pareto dominance-based methods, responsible for global evolution and local evolution, respectively. These two populations collaborate through substantial information exchange, thereby facilitating each other's evolution. Firstly, the distribution of the two populations is analyzed and an individual exploitation operation is designed for locPop to exploit some promising areas that are undeveloped in globPop. . Then, the guide-position is devised for globPop to indicate the optimal point for a subproblem on the Pareto front (PF). By using the guide-position, a strategy for generating uniform weight vectors is proposed to improve the population diversity. Finally, comprehensive experiments on 37 widely used test functions and 2 real-world problems demonstrate that the proposed DPEA-IEAW outperforms comparison algorithms in solving MOPs with various PFs.
引用
收藏
页数:20
相关论文
共 68 条
  • [1] [Anonymous], 2009, Working Report CES-487
  • [2] HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
    Bader, Johannes
    Zitzler, Eckart
    [J]. EVOLUTIONARY COMPUTATION, 2011, 19 (01) : 45 - 76
  • [3] A Decomposition-Based Many-Objective Evolutionary Algorithm With Two Types of Adjustments for Direction Vectors
    Cai, Xinye
    Mei, Zhiwei
    Fan, Zhun
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (08) : 2335 - 2348
  • [4] Evolutionary Dynamic Constrained Multiobjective Optimization: Test Suite and Algorithm
    Chen, Guoyu
    Guo, Yinan
    Wang, Yong
    Liang, Jing
    Gong, Dunwei
    Yang, Shengxiang
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2024, 28 (05) : 1381 - 1395
  • [5] Come D, 2007, GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P773
  • [6] Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems
    Das, I
    Dennis, JE
    [J]. SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) : 631 - 657
  • [7] A decomposition-based many-objective evolutionary algorithm updating weights when required
    de Farias, Lucas R. C.
    Araujo, Aluizio F. R.
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2022, 68
  • [8] Deb K, 2004, ADV INFO KNOW PROC, P105
  • [9] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [10] Deb K., 1995, Complex Systems, V9, P115