earticle

논문검색

DEGSO : Hybrid Group Search Optimizer with Differential Evolution Operator

초록

영어

In standard group search optimizer (GSO) algorithm, scroungers will converge to the similar position if the producer cannot find a better position than the old one in a number of successive iterations and the group may suffer from the premature convergence. In this paper, a hybrid GSO with differential evolution (DE) operator named DEGSO is proposed to enhance the diversity of standard group search optimizer. In this method, the standard GSO algorithm and the DE operator alternate at the odd iterations and at the even iterations. The results of the experiments indicate that DEGSO is competitive to some other evolutionary computation (EA) algorithms.

목차

Abstract
 1. Introduction
 2. Group Search Optimizer
 3. Differential Evolution Algorithm
 4. The Improved GSO with DE
 5. Simulation and Results
 6. Conclusion
 Acknowledgements
 References

저자정보

  • Yu Xie School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, China
  • Chunxia Zhao School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, China
  • Haofeng Zhang School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, China
  • Debao Chen School of Physics and Electronic Information, Huaibei Normal University, Huaibei, China

참고문헌

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

    함께 이용한 논문

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

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