Evolutionary Multi/Many-Objective Optimisation via Bilevel Decomposition
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.
Authors
- Shouyong Jiang (ORCID: https://orcid.org/0000-0001-5099-2093)
- Shengxiang Yang (ORCID: https://orcid.org/0000-0001-7222-4917)
- Yong Wang (ORCID: https://orcid.org/0000-0001-7670-3958)
- Jinglei Guo (ORCID: https://orcid.org/0000-0002-8155-8342)
Institutions
- Central South University (CN)
- Central China Normal University (CN)
- De Montfort University (GB)
Publication Details
- Journal
- IEEE/CAA Journal of Automatica Sinica
- Published
- 2024-08-16
- DOI
- https://doi.org/10.1109/jas.2024.124515
- Citations
- 2
- Primary Topic
- Advanced Multi-Objective Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.72
Funders
- National Natural Science Foundation of China