摘要: 粒子群算法又称粒子群优化算法(POS),是一种基于群体智能的智能优化算法。粒子群优化算法在电子,通信,计算和控制系统有着广泛的应用。粒子群优化算法现在主要存在两个问题,搜索后期易出现局部最优和收敛早熟。通过构造新的加权函数来处理这些问题——自适变异粒子群算法。本文主要通过数学函数的优化仿真现象,证明粒子群优化算法在复杂函数求解中有很大优势,增加算法的全局搜索能力,使算法避免收敛早熟。33587 毕业论文关键词: 粒子群优化; 局部最优; 加权函数; 收敛早熟;自适变异
Study on the application of particle swarm algorithm
Abstract: Particle swarm optimization (POS) algorithm is also called particle swarm optimization algorithm (POS), is a kind of intelligent optimization algorithm based on swarm intelligence. Particle swarm optimization algorithm in the electronics, communications, computing and control system has been widely used. There are two problems with particle swarm optimization algorithm mainly now, search later susceptible to local optimum and premature convergence. By constructing a new weighted function to deal with these problems, adaptive mutation particle swarm optimization (POS) algorithm. This paper by mathematical function optimization simulation phenomenon, proved that the particle swarm optimization algorithm in solving complex function has a lot of advantage, increase the global search ability of the algorithm, algorithm avoid premature convergence.
Key words:Particle swarm optimization;Local optimal;Weighted function Premature convergence ; Adaptive mutation
目 录