多群优化
粒子群优化
元启发式
数学优化
模拟退火
无导数优化
水准点(测量)
群体行为
并行元启发式
计算机科学
惯性
职位(财务)
全局优化
元优化
帝国主义竞争算法
数学
物理
地理
经济
经典力学
大地测量学
财务
作者
Dawei Zhou,Gao Xiang,Guohai Liu,Congli Mei,Dong Xiang Jiang,Ying Liu
标识
DOI:10.1016/j.eswa.2011.06.029
摘要
This paper introduces a novel particle swarm optimization (PSO) with random position to improve the global search ability of particle swarm optimization with linearly decreasing inertia weight (IWPSO). Standard particle swarm optimization and most of its derivations are easy to fall into local optimum of the problem by lacking of mutation in those operations. Inspired by the acceptance probability in simulated annealing algorithm, the random factors could be put in particle swarm optimization appropriately. Consequently, the concept of the mutation is introduced to the algorithm, and the global search ability would be improved. A particle swarm optimization with random position (RPPSO) is tested using seven benchmark functions with different dimensions and compared with four well-known derivations of particle swarm optimization. Experimental results show that the proposed particle swarm optimization could keep the diversity of particles, and have better global search performance.
科研通智能强力驱动
Strongly Powered by AbleSci AI