搜索资源列表
20070609
- 高斯回代算法源代码 蚁群算法的matlab源码 蚁群算法TSP(旅行商问题)通用matlab程序 Java实现几种常见的排序算法 用pascal语言实现希尔排序算法-Gaussian back to the source code generation algorithm Ant Algorithm Matlab source Ant Algorithm TSP (TSP) General Matlab procedures Java Several ranking algori
GA_TSA
- 利用遗传算法解决TSP旅行商问题的Java原码-using genetic algorithms to solve the traveling salesman problem TSP original Java code
SA_TSA
- 利用模拟退火算法解决旅行商问题的java原码-using simulated annealing algorithm to solve the traveling salesman problem java original code
TS-TSP.rar
- 使用禁忌搜索算法求解TSP（旅行商问题）的JAVA源程序,The use of tabu search algorithm for solving TSP (Traveling Salesman Problem) the JAVA source code
TSP.rar
- 模拟退火算法解决旅行商问题，从文件读入城市信息,Simulated annealing algorithm to solve traveling salesman problem, reading from the file information into the city
SA_TSP.rar
- 使用模拟退火算法求解TSP（旅行商）问题的JAVA源程序,The use of simulated annealing algorithm for solving TSP (traveling salesman) problem with JAVA source
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
Program
- 用很简单的方法描述了如何勇贪婪算法解决旅行商问题-Using very simple methods Yong describes how greedy algorithm to solve traveling salesman problem
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
SimulatedAnnealing
- 旅行商问题的模拟退火算法实现 采用VHDL仿真，软件java来varificatio。本例中采用16个城市-Traveling Salesman Problem Algorithm of Simulated Annealing using VHDL simulation, software, java to varificatio. In this case the use of 16 cities
GA_java
- java版的经典遗传算法源码 功能：经典遗传算法类，用来实现其在NM96文献中关于旅行商问题的算法.-Genetic Algorithm source code in java
upload4
- 使用模拟退火算法解决旅行商问题 程序框架中的Annealing.java文件，Annealing.java实现了Inter.java接口中的函数。接口函数getStrategy是一个返回类型为void的函数，函数的输入参数是一个字符串，代表输入文件的文件名-The use of simulated annealing algorithm to solve the TSP program in the framework of Annealing.java files, Annealing.j
upload5
- 遗传算法求解旅行商问题。在n=20的情况下依然能90 以上获得正确解。-Genetic Algorithm for Traveling Salesman Problem. In the case of n = 20 can still obtain the correct solution for more than 90 .
TSP
- ＪＡＶＡ语言实现的遗传算法解决TSP（旅行商问题），主要有三个简单的Java类。-JAVA language of the genetic algorithm to solve TSP (traveling salesman problem), there are three simple Java class.
traveler
- 旅行商问题的分支限界法 经典算法的JAVA实现-Traveling Salesman Problem classical branch and bound algorithm to achieve JAVA
algorithm_report
- 算法分析与设计报告，用java编写的4个常见的算法小程序。包括矩阵相乘问题，0/1背包问题，删数问题，和旅行商问题。-Algorithm analysis and design reports using java prepared four common algorithm applet. Including matrix multiplication problem, 0/1 knapsack problem, delete a few problems, and traveling sal
TSP-Problem-code
- 2011年进化竞赛旅行商问题java代码-The Physical Travelling Salesperson Problem,java code
doc
- java编制旅行商路径优化问题的遗传算法程序-java the preparation of the traveling salesman path optimization problem genetic algorithm
GeneticAlgorithm
- 遗传算法解决背包问题和旅行商问题。 测试数据已经写入java代码中。 遗传算法的参数可以修改。-Genetic algorithm to solve the knapsack problem and the traveling salesman problem. The test data has been written to the java code. The parameters of the genetic algorithm can be modified.
旅行商
- 利用分支界限算法实现旅行销售商问题的分支限界算法(Branch and bound algorithm for the traveling salesperson problem)