摘要
针对标准粒子群优化算法PSO(Particle Swarm Optimization)在处理高维复杂函数时存在收敛速度慢、易陷入局部最优和算法通用性不强等缺点,提出了一种基于混沌优化机制的双粒子群优化算法。它借鉴群体适应值方差的早熟判断机制,同时提出了一种逐步缩小搜索变量空间的新方法。典型数值实验表明,该算法效率高、优化性能好、对初值具有很强的鲁棒性。尤其是该算法具有很强的避免局部极小能力,其性能远远优于单一优化方法。
Using Particle Swarm Optimization to handle complex functions with high - dimension has the problems of low convergence speed and sensitivity to local convergence. This paper proposes a Double Panicle Swarm Optimization Based on Chaos Optimization Strategy , It adopts prematurity judge mechanism by the variance of the population＇ s fitness and reducing the searching space of variable optimized is proposed. Numerical simulation results on benchmark complex functions with high dimension show that the hybrid Particle Swarm Optimization is effective, efficient, fairly robust to initial conditions. Especially the hybrid Particle Swarm Optimization is of strong ability to avoid being trapped in local minima, and performances are fairly superior to single method.
出处
《计算机应用与软件》
CSCD
北大核心
2008年第10期258-260,共3页
Computer Applications and Software
关键词
双粒子群优化算法
双混沌优化机制
局部收敛
Double particle swarm optimaziton Double chaos optimization Local convergence
