搜索资源列表
ant-tsp-elimcross
- 蚁群算法求解tsp问题后去交叉.数据为att48，48个城市的tsp -Ant Algorithm tsp problems to cross. Att48 data, the 48 cities tsp
ACATSP
- 基于遗传算法的TSP问题求解，采用三个不同规模的城市模型，分别为att48、Berlin52和rd1-TSP problem based on genetic algorithms, the use of three different scale model of the city, were att48, Berlin52 and rd100
aco
- matlab编的蚁群算法解TSP问题（att48），调整参数可解决多类问题。-matlab code of ant colony algorithm for solving TSP problems (att48), adjust the parameters to resolve multi-class problems.
ACOTSP.V1.0
- visual c++ 编写的蚁群算法程序，解决对称性TSP问题(att48,att532,d198等)。-Program of ant colony algorithm visual written in visual c++ to solve symmetric TSP problems (att48, att532, d198, etc.).
att48.mat
- 利用蚁群算法求解旅行商问题的Matlab源程序-Matlab source code ant colony algorithm to solve the traveling salesman problem
TSPatt48
- 基本蚁群算法最优解求解TSP问题，关于att48的求解的matlab程序 -The basic ant colony algorithm the optimal solution to solve the TSP problem, solving about att48 matlab program
ant
- 用java实现了蚁群算法，并增加了画图功能，算法经过了优化，用att48数据集（附件里有）最高得到10812分(java ant colony algorithm, with drawing function, the algorithm has been optimized, with the att48 data set up to 10812 points)