earticle

논문검색

A Novel Hybrid Optimization Algorithm Based on GA and ACO for Solving Complex Problem

초록

영어

In allusion to the deficiencies of the ant colony optimization algorithm for solving the complex problem, the genetic algorithm is introduced into the ant colony optimization algorithm in order to propose a novel hybrid optimization (NHGACO) algorithm in this paper. In the NHGACO algorithm, the genetic algorithm is used to update the global optimal solution and the ant colony optimization algorithm is used to dynamically balance the global search ability and local search ability in order to improve the convergence speed. Finally, some complex benchmark functions are selected to prove the validity of the proposed NHGACO algorithm. The experiment results show that the proposed NHGACO algorithm can obtain the global optimal solution and avoid the phenomena of the stagnation, and take on the fast convergence and the better robustness.

목차

Abstract
 1. Introduction
 2. Genetic Algorithm and Ant Colony Optimization Algorithm
  2.1. Genetic Algorithm
  2.2. Ant Colony Optimization Algorithm
 3. The Hybrid Optimization Algorithm
  3.1. The Idea of Hybrid Optimization Algorithm
  3.2. The Steps of the NHGACO Algorithm
 4. Experimental Results and Analysis
 5. Conclusion
 References

저자정보

  • Bin Gao Wenzhou Key Laboratory of Material Processing and Die & Mould Technology,Wenzhou Vocational & Technical College, Wenzhou 325035, PR China
  • Jing-Hua Zhu Wenzhou Key Laboratory of Material Processing and Die & Mould Technology,Wenzhou Vocational & Technical College, Wenzhou 325035, PR China
  • Wen-chang Lang Wenzhou Key Laboratory of Material Processing and Die & Mould Technology,Wenzhou Vocational & Technical College, Wenzhou 325035, PR China

참고문헌

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

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