Ye Qianlin, Wang Zheng, Zhao Yanwei, Dai Rui, Wu Fei, Yu Mengjiao
College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, 310023, China.
School of Computer and Computational Sciences, Hangzhou City University, Hangzhou, 310015, China.
Sci Rep. 2023 Jul 20;13(1):11754. doi: 10.1038/s41598-023-38529-4.
The goal of the multi-objective optimization algorithm is to quickly and accurately find a set of trade-off solutions. This paper develops a clustering-based competitive multi-objective particle swarm optimizer using the enhanced grid for solving multi-objective optimization problems, named EGC-CMOPSO. The enhanced grid mechanism involved in EGC-CMOPSO is designed to locate superior Pareto optimal solutions. Subsequently, a hierarchical-based clustering is established on the grid for improving the accuracy rate of the grid selection. Due to the adaptive division of clustering centers, EGC-CMOPSO is applicable for solving MOPs with various Pareto front (PF) shapes. Particularly, the inferior solutions are discarded and the leading particles are identified by the comprehensive ranking of particles in each cluster. Finally, the selected leading particles compete against each other, and the winner guides the update of the current particle. The proposed EGC-CMOPSO and the eight latest multi-objective optimization algorithms are performed on 21 test problems. The experimental results validate that the proposed EGC-CMOPSO is capable of handling multi-objective optimization problems (MOPs) and obtaining superior performance on both convergence and diversity.
多目标优化算法的目标是快速准确地找到一组折衷解。本文提出了一种基于聚类的竞争性多目标粒子群优化器,利用增强网格来解决多目标优化问题,称为EGC-CMOPSO。EGC-CMOPSO中涉及的增强网格机制旨在定位优帕累托最优解。随后,在网格上建立基于层次的聚类,以提高网格选择的准确率。由于聚类中心的自适应划分,EGC-CMOPSO适用于求解具有各种帕累托前沿(PF)形状的多目标优化问题。特别地,通过对每个聚类中的粒子进行综合排名来丢弃劣解并识别领先粒子。最后,所选的领先粒子相互竞争,获胜者引导当前粒子的更新。在21个测试问题上对所提出的EGC-CMOPSO和八种最新的多目标优化算法进行了测试。实验结果验证了所提出的EGC-CMOPSO能够处理多目标优化问题(MOPs),并在收敛性和多样性方面获得优异性能。