earticle

논문검색

Investigation of Modified Bee Colony Algorithm with Particle and Chaos Theory

원문정보

Guo Cheng

피인용수 : 0(자료제공 : 네이버학술정보)

초록

영어

Foraging behavior of animal widely concerns researchers. Some swarm intelligence algorithms, such as ant colony optimization algorithm, particle swarm optimization algorithm, artificial fish swarm algorithm, and so on, have been developed. Artificial bee colony algorithm (ABC), which is based on self-organization model, has been proposed. Its application is mainly used in the field of numerical optimization. Researchers verify the outstanding performance in function optimization domain according to the comparison with other algorithms with various improvements. Artificial bee colony algorithm itself has better performance in solving high dimension function. It needs not large population size and can guarantee the global convergence. In the paper, from the view of improving the convergence rate of the algorithm, search operators have been studied and a faster algorithm has been proposed. At the same time, the search region has been optimized. According to the example verification, the new algorithm is effective and the algorithm can be used in the optimization field.

목차

Abstract
 1. Introduction
 2. Standard ABC Algorithm
 3. Modified ABC Algorithm
 4. Adaptive Search Space Introduction
  4.1 Dynamic Adjustments of the Search Space
  4.2 Chaotic Search
 5. Verification
 6. Conclusion
 Acknowledgment
 References

저자정보

  • Guo Cheng Shangluo College, Zhangye, Gansu, China

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.