搜索资源列表
sa-tsp
- 模拟退火在最短路径求解问题上的实际应用！-simulated annealing for the shortest path problem on the practical application!
tsp.rar
- 旅行商问题，总共30个城市，计算最优路线和最短路径,Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
tsp
- hopfield神经网络求解TSP问题，改程序设置了10个城市的随机位置，进而解决城市间最短路径问题。-hopfield neural network to solve TSP problem, the procedures set up to 10 cities random location, then the shortest path between cities to solve problem.
GATSP
- 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
tsp
- 用遗传算法解决最短路径优化TSP 问题（附matlab源程序.txt）-The solvelution of the shortest path optimization problem TSP by using genetic algorithms (matlab source. Txt)
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
MainAneal
- 求最短路径 tsp matlab M文件-The shortest path tsp matlab
tabu-matlabcode-tsp
- 蚁群法在最短路径中的运用，附带matlab代码-Ant in the use of the shortest path, with matlab code
TSP
- 这是TSP旅行商问题的代码 但是不能显示具体路径 可以得出最短路径的值-This is the traveling salesman problem TSP code, but can not display the specific path the value of the shortest path can be drawn
TSP--problem--solution
- TSP最短路径 最少时间 数学建模 -TSP shortest path at least time mathematical modeling
tsp
- 旅行商问题概述:找出一条n个给定的城市间的最短路径，使我们在回到出发的城市之前，对每个城市都只访问一次，即最短哈密顿回路问题。-Overview of the traveling salesman problem: to find the shortest path between a n given cities, so that before we return to the starting city, visit each city only once, the shortest Ham
TSP
- 使用遗传算法进行求解路线最短路径问题的VC++6.0源程序-Using a genetic algorithm to solve the line shortest path problem VC++6.0 source
TSP
- 遗传算法：旅行商问题（已知城市坐标，求路过各城市的最短路径）-Genetic algorithms: the traveling salesman problem (known city coordinates, find the shortest path passing cities)
chapter4-GA-TSP
- 遗传算法求TSP最短路径，非常有利于初学者学习-Genetic Algorithm for TSP shortest path, is very conducive for beginners to learn
tsp
- 用遗传算法求解旅行商问题，输出最短路径的最短路径长度。-Genetic Algorithm for Traveling Salesman problem, the output shortest path length of the shortest path.
tsp
- 关于旅行商问题求解最短路径的程序设计，本程序很好解决TSP问题的算法-About Traveling Salesman Problem solving the shortest path programming, this program is a good algorithm to solve TSP problem
TSP(matlab)
- 用蚁群算法来求解最短路径问题，在matlab下运行-Ant colony algorithm to solve the shortest path problem, run in matlab
TSP问题代码
- 本文是以旅行商问题为研究点，利用蚂蚁算法优化求解最短路径，平台工具是具有绘图功能的matlab软件。(This paper takes traveling salesman problem as the research point, and uses ant algorithm to optimize the shortest path. The platform tool is matlab software with drawing function.)
基于遗传算法的 TSP 算法
- tsp问题（全称：TravellingSalesmanProblem），又称为旅行商问题、货郎担问题、TSP问题，是一个多局部最优的最优化问题，遗传算法是一种基于种群演变一种优化的算法，在此基础上的优化程序会自动寻找出最短路(TSP (full name: TravellingSalesmanProblem), also known as the traveling salesman problem, traveling salesman problem, but TSP problem is
A Solution to TSP with GA
- 利用遗传算法解决最短路径问题（商旅问题）(Using genetic algorithm to solve the shortest path problem (business travel problem))