TSP Solution Based on the Ant Colony Algorithm
Computational and Information Sciences（2013）
摘要
Traveling salesman problem, a very famous NP-hard problem, has attracted a lot of attention in recent years. People focus on how to quickly get the optimal solution. In this paper, we first give the basic description of TSP, and then introduce the main idea and mechanisms of ant colony algorithm in detail. After that, the paper makes a further discussion on the steps and principles of the application in TSP. Finally, to illustrate it more clearly, a program based on the ant colony algorithm has been implemented. Through the experiments and the result graphics, it is clearly showed that this algorithm can effectively complete the search process and has a good performance in solving this problem.
更多查看译文
关键词
tsp solution,ant colony optimisation,optimal solution,traveling salesman problem,famous np-hard problem,travelling salesman problems,np-hard problem,ant colony algorithm,search problems,basic description,combinatorial optimization area,computational complexity,result graphics,search process,main idea,pheromone,good performance,recent year,salesman problem,np hard problem,probability,optimization
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要