Particle Swarm Optimization with Adaptive Mutation
Particle swarm optimization (PSO) has shown its good performance in many optimization problems. However, PSO could often easily fall into local minima because the particles could quickly converge to a position by the attraction of the best particles. Under this circumstance, all the particles could hardly be improved. This paper presents a hybrid PSO (AMPSO) to solve this problem by applying a novel adaptive mutation operator. Experimental results on 8 well-known benchmark functions show that the AMPSO achieves better results than the standard PSO, PSO with Gaussian mutation and PSO with Cauchy mutation on most test cases.
Particle swarm optimization (PSO) mutation function optimization
Jun Tang Xiaojuan Zhao
Department of Information Engineering Hunan Urban Construction College Xiangtan, China
国际会议
2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)
太原
英文
893-896
2009-07-10(万方平台首次上网日期,不代表论文的发表时间)