Self-Adaptive Ant Colony System for the Traveling Salesman Problem
- Authors
- Yu, Wei-jie; Hu, Xiao-min; Zhang, Jun; Huang, Rui-Zhang
- Issue Date
- Dec-2009
- Publisher
- IEEE
- Keywords
- Ant colony system (ACS); adaptive parameters control; traveling salesman problem
- Citation
- 2009 IEEE International Conference on Systems, Man and Cybernetics, pp 1399 - 1404
- Pages
- 6
- Indexed
- SCIE
SCOPUS
- Journal Title
- 2009 IEEE International Conference on Systems, Man and Cybernetics
- Start Page
- 1399
- End Page
- 1404
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115961
- DOI
- 10.1109/ICSMC.2009.5346279
- ISSN
- 1062-922X
- Abstract
- In the ant colony system (ACS) algorithm, ants build tours mainly depending on the pheromone information on edges. The parameter settings of pheromone updating in ACS have direct effect on the performance of the algorithm. However, it is a difficult task to choose the proper pheromone decay parameters alpha and rho for ACS. This paper presents a novel version of ACS algorithm for obtaining self-adaptive parameters control in pheromone updating rules. The proposed adaptive ACS (AACS) algorithm employs Average Tour Similarity (ATS) as an indicator of the optimization state in the ACS. Instead of using fixed values of alpha and rho, the values of alpha and rho are adaptively adjusted according to the normalized value of ATS. The AACS algorithm has been applied to optimize several benchmark TSP instances. The solution quality and the convergence rate are favorably compared with the ACS using fixed values of alpha and rho. Experimental results confirm that our proposed method is effective and outperforms the conventional ACS.
- Files in This Item
-
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.