Balancing Objective Optimization and Constraint Satisfaction in Constrained Evolutionary Multiobjective Optimization

被引:181
作者
Tian, Ye [1 ]
Zhang, Yajie [2 ]
Su, Yansen [2 ]
Zhang, Xingyi [2 ]
Tan, Kay Chen [3 ]
Jin, Yaochu [4 ]
机构
[1] Anhui Univ, Inst Phys Sci & Informat Technol, Minist Educ, Key Lab Intelligent Comp & Signal Proc, Hefei 230601, Peoples R China
[2] Anhui Univ, Sch Comp Sci & Technol, Key Lab Intelligent Comp & Signal Proc, Minist Educ, Hefei 230601, Anhui, Peoples R China
[3] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
[4] Univ Surrey, Dept Comp Sci, Guildford GU2 7XH, Surrey, England
基金
中国国家自然科学基金;
关键词
Statistics; Sociology; Optimization; Evolutionary computation; Search problems; Convergence; Sorting; Constrained multiobjective optimization problems (CMOPs); constraint satisfaction; evolutionary algorithm; objective optimization; DIFFERENTIAL EVOLUTION; HANDLING METHOD; ALGORITHM; MOEA/D;
D O I
10.1109/TCYB.2020.3021138
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Both objective optimization and constraint satisfaction are crucial for solving constrained multiobjective optimization problems, but the existing evolutionary algorithms encounter difficulties in striking a good balance between them when tackling complex feasible regions. To address this issue, this article proposes a two-stage evolutionary algorithm, which adjusts the fitness evaluation strategies during the evolutionary process to adaptively balance objective optimization and constraint satisfaction. The proposed algorithm can switch between the two stages according to the status of the current population, enabling the population to cross the infeasible region and reach the feasible regions in one stage, and to spread along the feasible boundaries in the other stage. Experimental studies on four benchmark suites and three real-world applications demonstrate the superiority of the proposed algorithm over the state-of-the-art algorithms, especially on problems with complex feasible regions.
引用
收藏
页码:9559 / 9572
页数:14
相关论文
共 51 条
  • [1] Angantyr A, 2003, IEEE C EVOL COMPUTAT, P1560
  • [2] A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization
    Asafuddoula, M.
    Ray, Tapabrata
    Sarker, Ruhul
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (03) : 445 - 460
  • [3] HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
    Bader, Johannes
    Zitzler, Eckart
    [J]. EVOLUTIONARY COMPUTATION, 2011, 19 (01) : 45 - 76
  • [4] Evolutionary Trajectory Planner for Multiple UAVs in Realistic Scenarios
    Besada-Portas, Eva
    de la Torre, Luis
    de la Cruz, Jesus M.
    de Andres-Toro, Bonifacio
    [J]. IEEE TRANSACTIONS ON ROBOTICS, 2010, 26 (04) : 619 - 634
  • [5] 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
  • [6] 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
  • [7] MOSES: A multiobjective optimization tool for engineering design
    Coello, CAC
    Christiansen, AD
    [J]. ENGINEERING OPTIMIZATION, 1999, 31 (03) : 337 - 368
  • [8] Analysis and Design Optimization of a Robotic Gripper Using Multiobjective Genetic Algorithm
    Datta, Rituparna
    Pradhan, Shikhar
    Bhattacharya, Bishakh
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2016, 46 (01): : 16 - 26
  • [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