Suppr超能文献

具有反向多领导者的多目标粒子群优化算法

Multi-objective particle swarm optimization with reverse multi-leaders.

作者信息

Chen Fei, Liu Yanmin, Yang Jie, Yang Meilan, Zhang Qian, Liu Jun

机构信息

School of Mathematics and Statistics, Guizhou University, Guiyang 550025, China.

School of Mathematics, Zunyi Normal College, Zunyi 563002, China.

出版信息

Math Biosci Eng. 2023 May 9;20(7):11732-11762. doi: 10.3934/mbe.2023522.

Abstract

Despite being easy to implement and having fast convergence speed, balancing the convergence and diversity of multi-objective particle swarm optimization (MOPSO) needs to be further improved. A multi-objective particle swarm optimization with reverse multi-leaders (RMMOPSO) is proposed as a solution to the aforementioned issue. First, the convergence strategy of global ranking and the diversity strategy of mean angular distance are proposed, which are used to update the convergence archive and the diversity archive, respectively, to improve the convergence and diversity of solutions in the archives. Second, a reverse selection method is proposed to select two global leaders for the particles in the population. This is conducive to selecting appropriate learning samples for each particle and leading the particles to quickly fly to the true Pareto front. Third, an information fusion strategy is proposed to update the personal best, to improve convergence of the algorithm. At the same time, in order to achieve a better balance between convergence and diversity, a new particle velocity updating method is proposed. With this, two global leaders cooperate to guide the flight of particles in the population, which is conducive to promoting the exchange of social information. Finally, RMMOPSO is simulated with several state-of-the-art MOPSOs and multi-objective evolutionary algorithms (MOEAs) on 22 benchmark problems. The experimental results show that RMMOPSO has better comprehensive performance.

摘要

尽管多目标粒子群优化算法(MOPSO)易于实现且收敛速度快,但在平衡收敛性和多样性方面仍需进一步改进。为此,提出了一种带反向多领导者的多目标粒子群优化算法(RMMOPSO)。首先,提出了全局排序的收敛策略和平均角距离的多样性策略,分别用于更新收敛存档和多样性存档,以提高存档中解的收敛性和多样性。其次,提出了一种反向选择方法,为种群中的粒子选择两个全局领导者。这有利于为每个粒子选择合适的学习样本,并引导粒子快速飞向真实的帕累托前沿。第三,提出了一种信息融合策略来更新个体最优值,以提高算法的收敛性。同时,为了在收敛性和多样性之间实现更好的平衡,提出了一种新的粒子速度更新方法。通过这种方法,两个全局领导者协同引导种群中粒子的飞行,有利于促进社会信息的交流。最后,在22个基准问题上,用几种先进的MOPSO算法和多目标进化算法(MOEA)对RMMOPSO进行了仿真。实验结果表明,RMMOPSO具有更好的综合性能。

相似文献

2
An External Archive-Guided Multiobjective Particle Swarm Optimization Algorithm.基于外部档案的多目标粒子群优化算法。
IEEE Trans Cybern. 2017 Sep;47(9):2794-2808. doi: 10.1109/TCYB.2017.2710133. Epub 2017 Jun 12.
6
Adaptive Gradient Multiobjective Particle Swarm Optimization.自适应梯度多目标粒子群优化算法。
IEEE Trans Cybern. 2018 Nov;48(11):3067-3079. doi: 10.1109/TCYB.2017.2756874. Epub 2017 Oct 9.

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验