A fast ant colony optimization for traveling salesman problem

Shih Pang Tseng, Chun Wei Tsai, Ming Chao Chiang, Chu-Sing Yang

研究成果: Conference contribution

15 引文 斯高帕斯(Scopus)

摘要

In this paper, we present an efficient method for speeding up Ant Colony Optimization (ACO), called Pattern Reduction Enhanced Ant Colony Optimization (PREACO). The proposed algorithm is motivated by the observation that many of the computations of ACO on its convergence process are essentially redundant and thus can be eliminated to reduce its computation time. To evaluate the performance of the proposed algorithm, we use it to solve the the traveling salesman problem (TSP). Moreover, we compare the proposed algorithm with several state-of-the-art ACO-based algorithms. Our simulation results indicate that the proposed algorithm can reduce the computation time of ACO algorithms we evaluated up to 99.21% or by a factor of 126.58 while limiting the degradation of the quality of the solution to a very small percentage compared to ACO algorithms themselves.

原文English
主出版物標題2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
DOIs
出版狀態Published - 2010 十二月 1
事件2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 - Barcelona, Spain
持續時間: 2010 七月 182010 七月 23

出版系列

名字2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Other

Other2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
國家Spain
城市Barcelona
期間10-07-1810-07-23

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Applied Mathematics

指紋 深入研究「A fast ant colony optimization for traveling salesman problem」主題。共同形成了獨特的指紋。

引用此