搜索资源列表
Knap12121
- 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
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.
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
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
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
lvxingshang.java
- 用java语言开发基于遗传算法理论的旅行商最短路径问题，包含遗传算法的常用基本理论。-The basic theory of common java language development based on the traveling salesman problem based on genetic theory shortest path algorithms, including genetic algorithm.
GA
- TSP，GA算法通过JAVA程序实现，旅行商问题-TSP, GA algorithm
GeneticAlgorithm-master
- 遗传算法解决旅行商的问题，通过java实现的源代码-GeneticAlgorithm master
TxTsp
- tsp的java源码实现旅行商问题，即TSP问题（Traveling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(The Java source of TSP is one of the famous problems in the field of mathemati