An Improved Ant Colony System and Its Application

  • Authors:

  • Xiangpei Hu;Qiulei Ding;Yongxian Li;Dan Song

  • Affiliations:

  • Institute of Systems Engineering, Dalian University of Technology, Dalian, China, 116023;Institute of Systems Engineering, Dalian University of Technology, Dalian, China, 116023;Institute of Systems Engineering, Dalian University of Technology, Dalian, China, 116023;Institute of Systems Engineering, Dalian University of Technology, Dalian, China, 116023

  • Venue:
  • Computational Intelligence and Security
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Ant Colony System (ACS) algorithm is vital in solving combinatorial optimization problems. However, the weaknesses of premature convergence and low efficiency greatly restrict its application. In order to improve the performance of the algorithm, the Hybrid Ant Colony System (HACS) is presented by introducing the pheromone adjusting approach, combining ACS with saving and interchange methods, etc. Furthermore, the HACS is applied to solve the Vehicle Routing Problem with Time Windows (VRPTW). By comparing the computational results with the previous findings, it is concluded that HACS is an effective and efficient way to solve combinatorial optimization problems.