Multi-Objective Evolutionary Algorithm Based on Decomposition With Orthogonal Experimental Design

被引:0
作者
He, Maowei [1 ]
Wang, Zhixue [2 ]
Chen, Hanning [1 ]
Cao, Yang [3 ]
Ma, Lianbo [4 ]
机构
[1] Tiangong Univ, Sch Comp Sci & Technol, Tianjin, Peoples R China
[2] Tiangong Univ, Sch Control Sci & Engn, Tianjin, Peoples R China
[3] China Med Univ, Sch Intelligent Med, Shenyang, Peoples R China
[4] Northeastern Univ, Coll Software, Shenyang, Peoples R China
关键词
indicator; irregular Pareto fronts; multi-objective evolutionary optimisation algorithm; orthogonal experimental design; selection operation; MANY-OBJECTIVE OPTIMIZATION; NONDOMINATED SORTING APPROACH; GENETIC ALGORITHM; MOEA/D; SELECTION;
D O I
10.1111/exsy.13802
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-objective evolutionary optimisation algorithms (MOEAs) have become a widely adopted way of solving the multi-objective optimisation problems (MOPs). The decomposition-based MOEAs demonstrate a promising performance for solving regular MOPs. However, when handling the irregular MOPs, the decomposition-based MOEAs cannot offer a convincing performance because no intersection between weight vector and the Pareto Front (PF) may lead to the same optimal solution assigned to the different weight vectors. To solve this problem, this paper proposes an MOEA based on decomposition with the orthogonal experimental design (MOEA/D-OED) that involves the selection operation, Orthogonal Experimental Design (OED) operation, and adjustment operation. The selection operation is to judge the unpromising weight vectors based on the history data of relative reduction values and convergence degree. The OED method based on the relative reduction function could make an explicit guidance for removing the worthless weight vectors. The adjustment operation brings in an estimation indicator of both diversity and convergence for adding new weight vectors into the interesting regions. To verify the versatility of the proposed MOEA/D-OED, 26 test problems with various PFs are evaluated in this paper. Empirical results have demonstrated that the proposed MOEA/D-OED outperforms eight representative MOEAs on MOPs with various types of PFs, showing promising versatility. The proposed algorithm shows highly competitive performance on all the various MOPs.
引用
收藏
页数:27
相关论文
共 66 条
  • [1] An elitist cooperative evolutionary bi-level multi-objective decomposition-based algorithm for sustainable supply chain
    Abbassi, Malek
    Chaabani, Abir
    Absi, Nabil
    Ben Said, Lamjed
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2022, 60 (23) : 7013 - 7032
  • [2] An Enhanced Decomposition-Based Evolutionary Algorithm With Adaptive Reference Vectors
    Asafuddoula, Md
    Singh, Hemant Kumar
    Ray, Tapabrata
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (08) : 2321 - 2334
  • [3] Bader J., 2008, HypE: An algorithm for fast hypervolume-based many-objective optimization
  • [4] The balance between proximity and diversity in multiobjective evolutionary algorithms
    Bosman, PAN
    Thierens, D
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) : 174 - 188
  • [5] A decomposition-based many-objective evolutionary algorithm with adaptive weight vector strategy
    Chen, Xin
    Yin, Jiacheng
    Yu, Dongjin
    Fan, Xulin
    [J]. APPLIED SOFT COMPUTING, 2022, 128
  • [6] A Weight Vector Adjustment Method for Decomposition-Based Multi-Objective Evolutionary Algorithms
    Cheng, Haibing
    Li, Lin
    You, Ling
    [J]. IEEE ACCESS, 2023, 11 : 42324 - 42330
  • [7] A benchmark test suite for evolutionary many-objective optimization
    Cheng, Ran
    Li, Miqing
    Tian, Ye
    Zhang, Xingyi
    Yang, Shengxiang
    Jin, Yaochu
    Yao, Xin
    [J]. COMPLEX & INTELLIGENT SYSTEMS, 2017, 3 (01) : 67 - 81
  • [8] A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization
    Cheng, Ran
    Jin, Yaochu
    Olhofer, Markus
    Sendhoff, Bernhard
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) : 773 - 791
  • [9] 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
  • [10] 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