搜索资源列表
sa-tsp
- 模拟退火在最短路径求解问题上的实际应用！-simulated annealing for the shortest path problem on the practical application!
TSP
- 实现最短路径的代码 有利于大家学习和工作需要-achieve the shortest path to the code you need to study and work
tsp.rar
- 旅行商问题，总共30个城市，计算最优路线和最短路径,Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
tsp
- 用递归法解决最短周游路径问题的java实现-Travel by the shortest path of the recursive method to solve the problem of the java implementation
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 simulation.
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
sa_tsp
- 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TS
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.
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
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)
tsp
- In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to ano
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
TSP
- 用matlab解决TSP旅行商问题,针对30个城市最短路径进行优化-Using matlab to solve the traveling salesman problem TSP for 30 cities to optimize the shortest path
tabu-matlabcode-tsp
- 蚁群法在最短路径中的运用，附带matlab代码-Ant in the use of the shortest path, with matlab code
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))
TS-TSP
- 用TS算法解决推销商最短路径问题，数据是中国的各个省会和直辖市(Salesman to solve the shortest path problem with TS algorithm, the data is Chinese all provincial capitals and municipalities directly under the central government)