期刊名称：International Scientific Journal of Management Information Systems
印刷版ISSN：1452-774X
出版年度：2011
卷号：6
期号：4
页码：010-014
出版社：University of Novi Sad
摘要：In this article, we study a possibility of solving the well-known Travelling Salesman Problem (TSP), which ranges among NP-hard problems, and offer a theoretical overview of some methods used for solving this problem. We discuss the Ant Colony Optimization (ACO), which belongs to the group of evolutionary techniques and presents the approach used in the application of ACO to the TSP. We study the impact of some control parameters by implementing this algorithm. The quality of the solution is compared with the optimal solution.
关键词：travelling salesman problem; met heuristics; ant colony optimization
