期刊名称：International Journal of Computing and Business Research
电子版ISSN：2229-6166
出版年度：2012
出版社：International Journal of Computing and Business Research
摘要：Combinatorial optimization problem are often easy to state but very difficult to solve. ACO is an intelligent metaheuristic optimization algorithm with strong robustness & the ability to find the optimal solution which gives it prominence to optimization problems. TSP is one of most intensively studied NP-hard problem in combinatorial optimization environment. The basic high-level view of an ACO algorithm for TSP are studied in this paper. The algorithm is realized under the MATLAB tool & applied to solve the TSP.
