Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2005.12B.7.823

Improved Ant Colony System for the Traveling Salesman Problem  

Kim, In-Kyeom (성결대학교 정보통신공학부)
Yun, Min-Young (성결대학교 정보통신공학부)
Publication Information
The KIPS Transactions:PartB / v.12B, no.7, 2005 , pp. 823-828 More about this Journal
Abstract
Ant Colony System (ACS) applied to the traveling salesman problem (TSP) has demonstrated a good performance on the small TSP. However, in case of the large TSP. ACS does not yield the optimum solution. In order to overcome the drawback of the An for the large TSP, the present study employs the idea of subpath to give more irormation to ants by computing the distance of subpath with length u. in dealing with the large TSP, the experimental results indicate that the proposed algorithm gives the solution much closer to the optimal solution than does the original ACS. In comparison with the original ACS, the present algorithm has substantially improved the performance. By utilizing the proposed algorithm, the solution performance has been enhanced up to $70\%$ for some graphs and around at $30\%$ for averaging over all graphs.
Keywords
Ant Colony System; Combinatorial Optimization; TSP;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Dorigo, M., and Gambardella, L. M, 'Ant Colonies for the Travelling Salesman Problem,' BioSystems 43, pp.73-81, 1997   DOI   ScienceOn
2 이승관, 정태충, 'Ant Colony System에서 효율적 경로 탐색을 위한 지역갱신과 전역갱신에서의 추가 강화에 관한 연구', 정보처리학회 논문지 B 제10-B, pp.237-242, 2003   과학기술학회마을   DOI
3 Dorigo, M. and Gambardella, L. M., 'Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem,' IEEE Transactions on Evolutionary Computation, Vol.1, No.1, 1997   DOI
4 Bianchi, L., Knowles, J. and Bowler, N., 'Local search the probabilistic salesman problem: correction to the 2-p-opt and 1-shift algorithms,' Technical Reports, IDSIA-18-03, Dalle Molle Institute of Artificial Intelligent, Switzerland, 2003
5 http://www.aco-metaheuristic.org/aco-code
6 http://www.iwr.uni-heidelberg.de/groups/comopt/softwareTSPLIB95/tsp
7 Gambardella, L. M. and Dorigo, M., 'Solving symmetric and asymmetric TSPs by ant colonies,' Proceedings of IEEE International Conference on Evolutionary Computation, IEEE-EC 96, IEEE Press, pp.622-627, 1996   DOI
8 Dorigo, M. and Stutzle T., Ant Colony Optimization, MIT Press, 2003
9 Gomez, O. and Baran, B., 'Reasons of ACO's Success in TSP,' Proceedings of 4th International Workshop in Ant Colony Optimization and Swarm Intelligence, LNCS VoI.3172, pp.226-237, 2004   DOI
10 Bonabeau, E., Dorigo, M., and Theraulaz, G., 'Swarm Intelligence: From Natural to Artificial Systems,' Oxford University Press, 1999
11 Dorigo, M, Caro, G. D, and Gambardella, L. M, 'Ant Algorithms for Discrete Optimization,' Artificial Life, Vol.5, No.3, pp.137-172, 1999   DOI   ScienceOn
12 Dorigo, M and Maniezzo, V., 'The Ant System: Optimization by a colony of cooperating agents,' IEEE Transactions on Systems, Man, and Cybernetics-Part B, Vol.26, No.1, pp.1-13, 1996   DOI