Many-Objective Evolutionary Algorithm Based on Spectral Clustering and Population Distribution
Numerous real-world applications involve complex many-objective optimization problems characterized by a large number of objective functions. Despite the development of various algorithms to address this kind of problems, these approaches often suffer from insufficient selection pressure, complex Pareto front shapes, and uneven distribution of solutions. To address this issue, this paper introduces a many-objective evolutionary algorithm based on spectral clustering and population distribution. We first utilize spectral clustering to classify the objective functions based on their correlations and aggregate them within the same class to reducing the complexity of the problem. Then, we propose a knowledge-guided decomposition based evolutionary algorithm to solve the simplified model. Finally, we conduct a series of comparative experiments to evaluate the effectiveness of the proposed method. The experimental results indicate that our method demonstrates excellent performance across various problems.
Authors
- Bin Liu (ORCID: https://orcid.org/0000-0002-8958-3999)
- Jiaqi Yao (ORCID: https://orcid.org/0009-0008-9714-169X)
Institutions
- The University of Adelaide (AU)
- Ocean University of China (CN)
Publication Details
- Published
- 2024-10-18
- DOI
- https://doi.org/10.1109/ntci64025.2024.10776165
- Primary Topic
- Industrial Technology and Control Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China