Multi-strategy Adaptive Multi-objective Particle Swarm Optimization Algorithm Based on Swarm Partition

被引：0

作者：

Zhang W. ^{[1
]}

Huang W.-M. ^{[1
]}

机构：

[1] School of Electrical Engineering and Automation, Henan Polytechnic University, Jiaozuo

来源：

Zidonghua Xuebao/Acta Automatica Sinica | 2022年 / 48卷 / 10期

基金：

中国国家自然科学基金;

关键词：

Multi-objective optimization; multi-strategy; particle swarm optimization; swarm partition;

D O I：

10.16383/j.aas.c200307

中图分类号：

学科分类号：

摘要：

In the multi-objective particle swarm optimization algorithm, balancing the convergence and diversity of the algorithm is the key to obtain the Pareto front with good distribution and accuracy. Most of the proposed methods rely on only one strategy to guide the particle search, and the algorithm may lack convergence and diversity when solving complex problems. To solve this problem, a multi-strategy adaptive multi-objective particle swarm optimization based on swarm partition is proposed. Firstly, the algorithm detects environment by the convergence contribution of particles and adjusts the process of particle exploration and exploitation adaptively. Secondly, in order to accurately formulate the search strategy of particles with different performances, a multi-strategy global optimal particle selection method and a mutation method are proposed. According to the evaluation index of the convergence of the particles, the population is divided into three regions. Combining particle performance with the algorithm optimization process can improve the search efficiency of each particle. Thirdly, an individual optimal particle selection scheme with memory interval is proposed to solve the problem that the algorithm falls into local optimization because the selected individual optimal particles cannot guide the flight direction of particles effectively. That can improve the reliability of individual optimal particle selection, and accelerate the process of particle convergence. Finally, the fusion metric including particle convergence and diversity is used to maintain the external archive. It can avoid deleting the particles with good convergence and resulting in population degradation and affecting particle development capabilities, when external archive maintenance is just based on the particle density. Experimental results show that the proposed algorithm has good performance compared with some other multi-objective optimization algorithms. © 2022 Science Press. All rights reserved.

引用

页码：2585 / 2599

页数：14

共 28 条

[1]

Qiao Jun-Fei, Li -Fei, Yang Cui-Li, An NSGAⅡ algorithm based on uniform distribution strategy, Acta Automatica Sinica, 45, 7, pp. 1325-1334, (2019)

[2]

Cheng S, Zhao L L, Jiang X Y., Many-objective particle swarm optimization based on adaptive fuzzy dominance, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 14, 1, (2017)

[3]

Feng Q, Li Q, Chen P, Hen W, Xue Z E, Yin L, Ge C., Multi-objective particle swarm optimization algorithm based on adaptive angle division, IEEE Access, 7, pp. 87916-87930, (2019)

[4]

Liu X F, Zhan Z H, Gao Y, Zhang J, Kwong S, Zhang J., Coevolutionary particle swarm optimization with bottleneck objective learning strategy for many-objective optimization, IEEE Transactions on Evolutionary Computation, 23, 4, pp. 587-602, (2019)

[5]

Yu Wei-Wei, Xie Cheng-Wang, Bi Ying-Zhou, Xia Xue-Wen, Li Xiong, Ren Ke-Yan, Et al., Many-objective particle swarm optimization based on adaptive fuzzy dominance, Acta Automatica Sinica, 44, 12, pp. 2278-2289, (2018)

[6]

Li L, Wang W L, Li W K, Xu X L, Zhao Y W., A novel ranking-based optimal guides selection strategy in MOPSO, Procedia Computer Science, 91, pp. 1001-1010, (2016)

[7]

Coello C A C, Pulido G T, Lechuga M S., Handling multiple objectives with particle swarm optimization, IEEE Trans on Evolutionary Computation, 8, 3, (2004)

[8]

Raquel C R, Naval P C., An effective use of crowding distance in multiobjective particle swarm optimization, Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp. 257-264, (2005)

[9]

Yen G G, Leong Wen F., Dynamic multiple swarms in multiobjective particle swarm optimization, IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 39, 4, (2009)

[10]

Peng W, Zhang Q F., A decomposition-based multi-objective particle swarm optimization algorithm for continuous optimization problems, Proceedings of the 2008 IEEE International Conference on Granular Computing, pp. 534-537, (2008)

← 1 2 3 →