粒子群优化
群体行为
数学优化
计算机科学
理论(学习稳定性)
算法
水准点(测量)
局部最优
多群优化
功能(生物学)
利基
趋同(经济学)
数学
机器学习
物理
生物
进化生物学
经济
经济增长
核磁共振
地理
大地测量学
出处
期刊:Journal of Computer Applications
[China Science Publishing & Media Ltd.]
日期:2007-01-01
被引量:1
摘要
A modified niching Particle Swarm Optimization(PSO) algorithm was constructed which allowed unimodal function optimization methods to efficiently locate all optima of multimodal problems that the Niche PSO cannot reach.In the new algorithm,the sequential niche technique was introduced.Firstly,a stretching technique was adopted in main swarm.Secondly,the dismissal mechanism was used in subswarms namely when a local extreme point of value was found in sub-swarms,the sub-swarms would be dismissed and regressed to the main swarm.At last,the radius of created sub-swarms was confined in order to avoid the excessive of radius.The new Stretching-Niche PSO(SNPSO) algorithm could resolve the disadvantage of standard Niche PSO that the local best of value depends on the number of sub-swarms and easily has the problem of iteration and pretermission.Testing of the algorithm by using three benchmark functions indicate that the modified niching PSO has better performance than standard Niche PSO in terms of the stability,convergence and coverage in searching a better value.
科研通智能强力驱动
Strongly Powered by AbleSci AI