搜索资源列表
TSP
- 本系统是用C#语言进行旅行商问题（TSP)的实验仿真，来实现从一个城市到最后一个城市的最短路径的模拟。-This system is to use C# language Traveling Salesman Problem (TSP) of the experimental simulation, to move from one city to the last one the city' s shortest path si
GATSP201046
- 使用遗传算法解决旅行商问题，用户自己设置城市参数，有良好的处理速度！-The use of genetic algorithm to solve traveling salesman problem, the user set up their own city parameters, good speed!
taiozhanbei
- 用遗传算法和模拟退火算法解决旅行商方面的问题-The genetic algorithm and simulated annealing algorithm to solve traveling salesman problems
ant
- 蚁群算法结合2-opt技术解决旅行商问题（TSP）-Ant colony algorithm with 2-opt technology to solve the traveling salesman problem (TSP)
travelingsalesmanproblem
- 这是用Delphi编写的动态规划旅行商问题，程序完整，可运行-It is written in Delphi traveling salesman problem dynamic programming, program integrity, and can run. . .
2
- tsp遗传算法代码 利用交叉算子改进方法求解旅行商问题-tsp genetic algorithm code
TSPPSO
- 用该进的粒子群优化算法来解决旅行商问题，即TSP问题（Traveling Salesman Problem）-Using the advanced PSO algorithm to solve TSP（Traveling Salesman Problem）
dongtaiguihua
- 用动态规划算法计算旅行商 挺不错的，可以看看 输入的时候是输入矩阵 需要自己换行-Dynamic programming algorithm with very good salesman, you can see when the input is the input matrix needs its own wrap
DynamicProgramming
- 数据结构的作业，用动态规划算法解决旅行商问题-Data structure operations, with a dynamic programming algorithm to solve traveling salesman problem
gega
- 模拟退火算法，可以实现matlab中的旅行商问题，谢谢下载。-The emulation backs fire calculate way
Tsp
- 动态规划关于旅行商问题的C++实现源代码。-On the traveling salesman problem dynamic programming C++ implementation source code. 11111111
tsp_NSGA
- 解决多目标的旅行商问题，可得出非劣解和前沿图(To solve the multi-objective traveling salesman problem, we can obtain the non inferiority solution and the frontier graph)
ACO_TSP
- 利用蚁群算法求解旅行商问题，求解100个城市的最短路程(Using Ant Colony Optimization to solve TSP problem)
GA-TSP
- 利用遗传算法求解旅行商问题，求解100城市的最短路程(Using GA to solve TSP problem)
Ant_TSP
- 基于蚁群算法的旅行商问题，matlab源代码，带功能说明(Ant colony algorithm for traveling salesman problem matlab source code)
基于蚁群算法解决旅行商问题
- 主要讲解了如何用蚁群算法来解决 旅行商问题(Mainly explains how to use ant colony algorithm to solve travel salesman problem)
GATraveller
- GAT旅行商，随机生成城市，一个出发点，最终回到初始点。遍历计算，求最短路径(GAT travel agents randomly generate cities, a starting point, and eventually back to the initial point. Traversal calculation, seek the shortest path)
TspTS
- 采用禁忌搜索算法求解旅行商问题，欢迎下载(Traveling salesman problem is solved by Tabu Search Algorithm)
旅行商问题
- 基于遗传算法求解旅行商问题，程序中随机设置了城市点出现的情况。(Genetic algorithm based travel salesman problem, the program randomly set up the city point of view.)
连续Hopfield神经网络的优化—旅行商问题优化计算
- 连续Hopfield神经网络的优化 旅行商问题优化计算(Traveler problem optimization calculation)