文件名称:ACA_TSP
介绍说明－－下载内容均来自于网络，请自行研究使用
旅行商问题（Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
此处使用蚁群算法求解TSP问题-Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm
to work out the TSP.
此处使用蚁群算法求解TSP问题-Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm
to work out the TSP.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
蚁群算法求解TSP问题.pdf
ACA_TSP.m