搜索资源列表
HolyMoley
- 本软件主要用于帮助计算机爱好者学习蚁群算法时做有关蚁群算法的试验。蚁群算法作为一种优秀的新兴的算法，具有非常广的应用前景，越来越多的人开始学习蚁群算法，因此本软件也有推广前景。 本软件除了用于教学目的外，还可用于解决实际生活中的与TSP（即，旅行商问题）问题相关的问题。 TSP问题描述的是一个旅行商要到几个城市去，每个城市必须去一次且仅能去一次，要求满足这样条件的 最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排等多种约束满足问题。 -the software us
shortestroute
- 这是一个优化程序包，主要用于解决TSP等经典问题中的最短路径的寻求。-This is an optimization package will primarily be used TSP such classic problem of the search for the shortest path.
TSP
- 实现最短路径的代码 有利于大家学习和工作需要-achieve the shortest path to the code you need to study and work
TSP
- 本系统是用C#语言进行旅行商问题（TSP)的实验仿真，来实现从一个城市到最后一个城市的最短路径的模拟。-This system is to use C# language Traveling Salesman Problem (TSP) of the experimental simulation, to move from one city to the last one the city' s shortest path simulation.
tsp
- 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
sa_tsp
- 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TS
tsp
- 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
sdfsasdg
- This package is a dual population of ant colony algorithm to seek, the shortest path problem, that is typical TSP problem, the packa
GoodPoint
- 使用佳点集遗传算法，解决安徽十七市的TSP问题，求出最短路径主要区别于普通遗传算法的地方是染色体交叉部分，另外编码方式使用十进制方式。-Good point set genetic algorithm used to solve TSP problem the city of Anhui, 17, find the shortest path to the main place is different from ordinary genetic algorithm is crossover s
tsp
- tsp寻址，在已知的城市地图中寻找到达目的地的最短路径-tsp addressing, in a known map of the city to find the shortest path to reach destination
TravelerTSP
- 旅行商问题(TSP问题)就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。 本题假定该旅行商从第1个城市出发。-Traveling salesman problem (TSP problem) is a vendor from the n cities, starting in a city, do not finish the rest of repeated n-1 cities and return to t
SIMULATEDANNEALING
- 此程序专门用于求解TSP问题中的最短路。-This program is designed for solving the TSP problem in the shortest path.
tsp
- This a matlab code which deals with TSP problem. This done using ant colony algorithm. In this problem each city gets visited once and a shortest path is obtained.-This is a matlab code which deals with TSP problem. This is done using ant colony algo
tsp
- 用c语言来求解tsp问题，最终输出最短距离的路径。-C language to solve tsp problem, the final output of the shortest path distance.
Tsp
- 蚁群算法的实现TSP最短路径，实现了48个城市之间的最短路径的实现-TSP ant colony algorithm to achieve the shortest path to achieve the shortest path between the city' s 48
遗传算法
- 优化TSP路径，可以最短路径完成旅行商问题(Optimizing TSP path,the shortest path can be used to solve the traveling salesman problem.)