搜索资源列表
vivaldi-sim-Aug232006.tar
- 题描述的是一个旅行商要到几个城市去,每个城市必须去一次且仅能去一次,要求满足这样条件的最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排-that descr iption is a traveling salesman to several cities, each city must go to one and only one, satisfy requirements for the shortest path. This software can be used for som
acopt
- A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker