搜索资源列表
tsp
- 利用模拟退火算法解决TSP问题（C++实现）-TSP PROBLEM
TSP-InvertOver
- 采用Inver-over算法求解TSP问题(包括测试算例)，算法结果较好，收敛较快。-This algorithm introuduce the Inver-over operotor that is solved TSP problems.(Including testing benchmarks).
TSP-GA
- 使用遗传算法解决TSP问题，简单，通用，鲁棒性好-The use of genetic algorithm to solve the TSP problem, simple, universal, robust and good
tsp
- 用VB写的利用蚁群优化算法解决的20个点的TSP问题，给出了路径以及经过每个点的顺序。-Using VB to write the use of ant colony optimization algorithm to solve the 20 points of TSP problem, given the path and through each point order.
TSP
- this a branch and bound code for TSP-this is a branch and bound code for TSP
tsp
- 高级人工智能算法中的TSP问题求解，应用模拟退火算法实现-tsp problem solved in vc++
TSP
- 用matlab实现了简单遗传算法解决TSP问题，有界面。-Using matlab to achieve a simple genetic algorithm to solve the TSP problem, there are interfaces.
TSP
- 应用模拟退火算法求解TSP的主要程序，主要应用在ITS中。-Application of simulated annealing algorithm for TSP of the main proceeding.
GA-TSP
- 在matlab环境下，用遗传算法实现解决TSP问题。应该可以运行。。既不清楚了-deal with TSP problem with GA
GA-TSP
- GA-TSP 运用遗传算法求解TSP问题，需要分开函数保存在运行。-GA-TSP the use of genetic algorithm to solve TSP problem and needs to separate the function is saved in the running.
TSP
- 禁忌算法解决TSP问题，程序简单效率高，欢迎来完善-Tabu algorithm to solve TSP problem, the program simple and efficient, welcome to improve
TSP
- 模拟退火处理tsp问题，matlab 代码-tsp problem matlab code
TSP
- 遗传算法，可以实现遗传算法TSP优化，图形显示优化过程。可以设定遗传种群个数、变异率等参数。-Genetic algorithm, genetic algorithm can achieve TSP optimization, graphics optimization process. Can set the number of genetic populations, mutation rates and other parameters.
tsp-2.0
- 一个用Java编的TSP小工具，需要调试-TSP a small series with Java tools, need to debug
TSP
- TSP 模拟退火 求最短路径 哈米尔顿回路-tsp
TSP
- TSP问题的经典算法，是实验课的时候做出来的，希望对大家有用-TSP
TSP
- 用模拟退火算法和遗传算法实现TSP旅行商问题，并可以用Matlab对结果进行图形显示分析，非常实用于初学者-Using simulated annealing algorithm and genetic algorithm traveling salesman problem TSP, and the results can be used Matlab graphics analysis, very useful for beginners
TSP
- 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
TSP
- 利用遗传算法求解旅行商问题 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm traveling salesman problem, namely, th
TSP
- 这是用Delphi编写的程序，目的是用TSP（分支限界法）实现旅行商问题-This is a program written with Delphi, the purpose is to use TSP (branch and bound method) to achieve the traveling salesman problem