局部最优
莱维航班
粒子群优化
数学优化
水准点(测量)
计算机科学
多群优化
元启发式
趋同(经济学)
局部搜索(优化)
集合(抽象数据类型)
跳跃
算法
数学
随机游动
统计
物理
大地测量学
量子力学
经济增长
经济
程序设计语言
地理
作者
Tianhua Guan,Fei Han,Henry Han
出处
期刊:IEEE Access
[Institute of Electrical and Electronics Engineers]
日期:2019-01-01
卷期号:7: 183444-183467
被引量:24
标识
DOI:10.1109/access.2019.2960472
摘要
In the past few decades, multi-objective particle swarm optimization (PSO) has increasingly attracted attention from scientists. To obtain a set of more accurate and well-distributed solutions, many variations of multi-objective PSO algorithms have been proposed. However, for complicated multi-objective problems, existing multi-objective PSO algorithms are prone to falling into local optima because of their weak global search capability. In this study, a modified multi-objective particle swarm optimization algorithm based on levy flight and double-archive mechanism (MOPSO-LFDA) is proposed to alleviate this problem. On one hand, in the evolution process of the particles, levy flight is combined with PSO to avoid the algorithm falling into local optima. By expanding the search scope of the particles, levy flight can improve the global search ability of the particles and make them jump out of local optima with a high probability. On the other hand, when maintaining external archives, in addition to the primary external archive, a secondary external archive is created to avoid unnecessary removal of the particles that may be generated by traditional maintenance approaches. With the proposed double-archive mechanism, more useful particles can be kept, and thus the diversity of the solutions is increased. Moreover, in terms of accelerating the convergence rate, a novel leader selection strategy is presented, which selects particles closer to the boundary of the attainable objective set and with larger crowding distance as leaders in optimization. The proposed algorithm outperforms existing state-of-the-art multi-objective algorithms on benchmark test functions for its fast convergence and excellent accuracy.
科研通智能强力驱动
Strongly Powered by AbleSci AI