Decomposition-based multi-objective evolutionary algorithm for bi-optimal selection
Decomposition-based multi-objective evolutionary algorithms often suffer from premature convergence when dealing with complex Pareto fronts. To address this issue, this paper proposes a decomposition-based bi-optional optimization algorithm (MOEA/D-BOS). The proposed method integrates the SPEA-II selection mechanism and an individual exploration strategy into the MOEA/D framework to enhance population diversity and information retention. In addition, a new weight vector generation method and a scalarization function are designed to improve the uniformity of solution distribution. Benchmark experiments demonstrate that, compared with several advanced algorithms, MOEA/D-BOS achieves superior performance in terms of both convergence speed and population diversity.
Authors
- Jigen Peng (ORCID: https://orcid.org/0000-0002-7207-3183)
- Qinwei Fan (ORCID: https://orcid.org/0000-0002-1017-3496)
- Aoxue Yin
- Dewei Yang (ORCID: https://orcid.org/0009-0005-0080-1515)
- Haiyang Li (ORCID: https://orcid.org/0000-0001-9927-2126)
- Jian Wang (ORCID: https://orcid.org/0000-0001-8140-5074)
Institutions
- University of Leeds (GB)
- Xi'an Polytechnic University (CN)
- Guangzhou University (CN)
- China University of Petroleum, East China (CN)
- Huazhong University of Science and Technology (CN)
Publication Details
- Journal
- Swarm and Evolutionary Computation
- Published
- 2025-11-20
- DOI
- https://doi.org/10.1016/j.swevo.2025.102228
- Primary Topic
- Advanced Multi-Objective Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00