基于微粒群的约束优化[EB/OL]
北京:中国科技论文在线
) 摘要: 微粒群算法在处理约束优化问题时
该算法通过引入微粒不可行历史最优
针对这一问题提出了一种泛学习微粒群算法(ULPSO)
增强了微粒群算法的搜索智能
使得微粒的学习更具多样性和有效性
表明了该算法求解约束优化问题的计算快速性
particle swarm optimization(PSO) is difficult to balance the relationship between constrains and optimization
A ubiquitous—learning swarm optimization (ULPSO) was proposed in order to solve this problem
Via incorporating infeasible personal best for each particle, this algorithm makes the study of particles more diversity and efficiency, enhances search intelligence
Finally,it is applied to a set of 13 well-known benchmark functions, and the experimental results illustrate its computing speed,stability and efficiency
Keywords: particle swarm optimization;Constrained Optimization;infeasible personal best;boundary;learn 下载PDF阅读器 PDF全文下载: 初稿 ( 110 ) 作者简介: 通信联系人: 【收录情况】 中国科技论文在线: 胡鹏