Earticle

초록

영어

Considering that the existing artificial bee colony (ABC) algorithm can not give simultaneously attention to evolution speed and solution quality, an improved ABC algorithm is proposed based on nelder-mead simplex method (NMSM) in this paper, and defined ad NMSM-ABC. In the process of iteration, the algorithm periodically passes the best individual vertex from NMSM operator into ABC, or migrates the optimal food source information from ABC to NMSM can get away from local minimum with aid of ABC. Hence, the proposed algorithm can realize cooperative co-evolution of the two so that the desired properties are obtained. In addition, the sensitivity analysis of the key parameter of NMSM-ABC is also conducted and the best value is suggested. Finally, Numerical experiments and comparisons on 6 benchmark functions are conducted with other ABC algorithms, and the results indicate that the proposed algorithm effectively overcomes the local minimum, and dramatically enhances the global searching ability and convergence speed, and is a good cooperative co-evolution algorithm.

목차

Abstract
 1. Introduction
 2. Standard ABC Algorithm
 3. Simplex Method
 4. NMSM-ABC
 5. Examples
 6. Conclusions
 References

키워드

저자

• Hongsheng Su [ School of Automation and Electrical Engineering, Lanzhou Jiaotong University, Lan zhou, China ]
• Kaile Yin [ School of Automation and Electrical Engineering, Lanzhou Jiaotong University, Lan zhou, China ]
• Zihan Wu [ School of Automation and Electrical Engineering, Lanzhou Jiaotong University, Lan zhou, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605