Evolutionary Multi/Many-Objective Optimisation via Bilevel Decomposition

被引:0
|
作者
Jiang, Shouyong [1 ,2 ]
Guo, Jinglei [3 ]
Wang, Yong [1 ]
Yang, Shengxiang [4 ]
机构
[1] Cent South Univ, Sch Automat, Changsha 410083, Peoples R China
[2] Univ Aberdeen, Dept Comp Sci, Aberdeen AB24 3FX, Scotland
[3] Cent China Normal Univ, Sch Comp Sci, Wuhan 430079, Peoples R China
[4] De Montfort Univ, Sch Comp Sci & Informat, Leicester LE1 9BH, England
基金
英国工程与自然科学研究理事会; 中国国家自然科学基金;
关键词
Bilevel decomposition; evolutionary algorithm; many-objective optimisation; multi-objective optimisation; ALGORITHM; MOEA/D; SELECTION;
D O I
10.1109/JAS.2024.124515
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Decomposition of a complex multi-objective optimisation problem (MOP) to multiple simple subMOPs, known as M2M for short, is an effective approach to multi-objective optimisation. However, M2M facilitates little communication/collaboration between subMOPs, which limits its use in complex optimisation scenarios. This paper extends the M2M framework to develop a unified algorithm for both multi-objective and many-objective optimisation. Through bilevel decomposition, an MOP is divided into multiple subMOPs at upper level, each of which is further divided into a number of single-objective subproblems at lower level. Neighbouring subMOPs are allowed to share some subproblems so that the knowledge gained from solving one sub-MOP can be transferred to another, and eventually to all the sub-MOPs. The bilevel decomposition is readily combined with some new mating selection and population update strategies, leading to a high-performance algorithm that competes effectively against a number of state-of-the-arts studied in this paper for both multi- and many-objective optimisation. Parameter analysis and component analysis have been also carried out to further justify the proposed algorithm.
引用
收藏
页码:1973 / 1986
页数:14
相关论文
共 50 条
  • [31] Evolutionary Many-objective Optimization: Difficulties, Approaches, and Discussions
    Sato, Hiroyuki
    Ishibuchi, Hisao
    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2023, 18 (07) : 1048 - 1058
  • [32] Decomposition and Dominance Relation Based Many-objective Evolutionary Algorithm
    Zhao Hui
    Wang Tianlong
    Liu Yanzhou
    Huang Cheng
    Zhang Tianqi
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2020, 42 (08) : 1975 - 1981
  • [33] Decomposition and cluster based expensive many-objective evolutionary algorithm
    Xu S.-S.
    Li J.-H.
    Li L.
    Li M.
    Kongzhi yu Juece/Control and Decision, 2024, 39 (02): : 440 - 448
  • [34] Decomposition and Dominance Relation Based Many-objective Evolutionary Algorithm
    Zhao H.
    Wang T.
    Liu Y.
    Huang C.
    Zhang T.
    Zhao, Hui (zhaohui@cqupt.edu.cn), 1975, Science Press (42): : 1975 - 1981
  • [35] Decomposition Based Dominance Relationship For Evolutionary Many-Objective Algorithm
    Chen, Lei
    Liu, Hai-Lin
    Tan, Kay Chen
    2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2017, : 1190 - 1195
  • [36] A many-objective evolutionary algorithm based on dominance and decomposition with reference point adaptation
    Zou, Juan
    Zhang, Zhenghui
    Zheng, Jinhua
    Yang, Shengxiang
    KNOWLEDGE-BASED SYSTEMS, 2021, 231
  • [37] Dynamic decomposition and hyper-distance based many-objective evolutionary algorithm
    Wang, Xujian
    Zhang, Fenggan
    Yao, Minli
    COMPLEX & INTELLIGENT SYSTEMS, 2025, 11 (01)
  • [38] A survey on multi-objective evolutionary algorithms for many-objective problems
    von Luecken, Christian
    Baran, Benjamin
    Brizuela, Carlos
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2014, 58 (03) : 707 - 756
  • [39] A new uniform evolutionary algorithm based on decomposition and CDAS for many-objective optimization
    Dai Cai
    Wang Yuping
    KNOWLEDGE-BASED SYSTEMS, 2015, 85 : 131 - 142
  • [40] Objective extraction via fuzzy clustering in evolutionary many-objective optimization
    Zhou, Aimin
    Wang, Yirui
    Zhang, Jinyuan
    INFORMATION SCIENCES, 2020, 509 : 343 - 355