搜索资源列表
Knap12121
- 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
用贪心算法解决旅行商问题
- 用贪心算法解决旅行商问题，能运行的，是本科四年级的软件课程设计源码！,Use greedy algorithm to solve traveling salesman problem, will be able to run is the fourth year undergraduate curriculum design of the software source code!
Genetic_Algorithm
- Java实现的遗传算法解旅行商问题，说明文件在doc中-Java implementation of the Genetic Algorithm for the traveling salesman problem, the documentation in the doc
simulated_annealing
- 人工智能问题，通过模拟退火算法实现旅行商问题，随机产生31个地址，计算旅行商走完的最短路径，并绘制路线图。作者：陈华昌-Using simulated annealing algorithm achive "traveler" problem.
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.
traveller
- 用回溯的方法解旅行商问题。可直接运行。 标题不小心写错了-With the back of the method to solve the traveling salesman problem. Can be run directly.
Knapsack
- 包含3个文件，背包问题，旅行商问题，最优BST，都是java编写的。-File have three parts .They are bag problem,knapsack problem and OptimalBST.
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.
Assign
- 基因编程方法的另一种特殊实现方法，解决旅行商问题-another special way to solve the Traveling Saleman Problem use genetic algorithm
A_star_TSP
- java语言下，用A星算法实现旅行商TSP问题-solve the traveling salesman problem(TSP)with A star algorithm by java
Tsp3
- 旅行商问题，安徽大学最优路径的寻找。利用机器学习中的遗传算法-Traveling salesman problem, the optimal path of Anhui University looking for.Using genetic algorithms in machine learning.
Ant-JAVA-2
- 蚂蚁算法的java实现 或称蚁群算法 用于解决TSP旅行商问题 尚待优化-Ant algorithm to achieve the java or ant colony algorithm to solve TSP traveling salesman problem yet to optimize
GenericAlgorithm
- 该代码为遗传算法以及两个实例，背包问题和旅行商问题，每个实例均有三组数据写在代码中，运行时将不需要的数据注释掉即可。-The source is about generic algorithm, including two examples, the knapsack problem and the traveling salesman problem.
yiqunsuanfa
- 蚁群算法求解旅行商问题，JAVA实现可视化效果，scr文件夹内的MainFrame.java为主框架代码-Ant colony algorithm for traveling salesman problem, JAVA achieve visual effects, scr folder within the main framework code MainFrame.java
GA
- 基于遗传算法的旅行商问题，求最小路径，java图形界面实现-Traveling salesman problem based on genetic algorithms for the minimum path, java graphical interface to achieve
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