搜索资源列表
tsp
- 用A*算法解决货郎担(旅行商)tsp问题,用文件读去,文件中需在第一行有数字n,然后再在后面n行输入n*n的数字矩阵,即可得出结果-A*
ga_tsp
- 遗传算法解决旅行商问题 很好的解决了TSP 这个 典型的NP-HARD问题-Genetic algorithm for TSP
TSP
- 旅行商问题(迪克斯基算法),swing界面,TSP.-Traveling salesman problem (Dick Gaussian algorithm), swing interfaces, TSP.
AstarTSP
- A星算法实现旅行商问题 有注释,通俗易懂,简单实现-Astar: TSP Problem in Java Having comments, easy to unerstand
GA
- 基因算法描述旅行商问题(Traveling Saleman Problem,TSP)-using Genetic Algorithm to implement the Traveling Saleman Problem.
A_star_TSP
- java语言下,用A星算法实现旅行商TSP问题-solve the traveling salesman problem(TSP)with A star algorithm by java
Ant-JAVA-2
- 蚂蚁算法的java实现 或称蚁群算法 用于解决TSP旅行商问题 尚待优化-Ant algorithm to achieve the java or ant colony algorithm to solve TSP traveling salesman problem yet to optimize
TSP
- 遗传算法求解TSP(旅行商问题)。算法设计作业自己做的答案-Genetic Algorithm for TSP
PSOLSp
- 10个粒子群算法的旅行商问题,内容详尽 ,可以此类推n个城市的算法-greedy algorithm to do with the country s 31 cities between the TSP source code, the executable in Annex compressed packet. Inside data.txt city.txt of data tables and urban name, and the executable on the same withi
GA
- TSP,GA算法通过JAVA程序实现,旅行商问题-TSP, GA algorithm
Advanced-Algorithm-master
- 用实例详细介绍基础的遗传算法,并通过遗传算法解决典型的旅行商(TSP)问题-The basic genetic algorithm is described in detail by the example, and the typical traveler (TSP) problem is solved by genetic algorithm
TxTsp
- tsp的java源码实现旅行商问题,即TSP问题(Traveling Salesman Problem)又译为旅行推销员问题、货郎担问题,是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路径的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(The Java source of TSP is one of the famous problems in the field of mathemati