搜索资源列表
TSP
- 遗传算法：旅行商问题（已知城市坐标，求路过各城市的最短路径）-Genetic algorithms: the traveling salesman problem (known city coordinates, find the shortest path passing cities)
TSP
- 遗传算法解决TSP问题 所谓TSP问题（旅行商问题）即最短路径问题就是在给定的起始点S到终止点T的通路集合中，寻求距离最小的通路，这样的通路成为S点到T点的最短路径。-Genetic algorithm to solve TSP problem called TSP problem (TSP) that the shortest path problem in a given starting point S to the end
andorid-TSP
- 安卓程序，包括解决旅行商问题的应用，指南针，寻求最短路径的小游戏，关于旅行商问题的介绍。-Andrews program, including application to solve the traveling salesman problem, compass, seeking the shortest path game, the introduction of the traveling salesman problem.
Traveling-salesman
- 旅行商问题：全国省会二维坐标如图30所示，基于遗传算法设计从黑龙江到西藏，并遍历全国各省会(每个省会只经过一次）的最短路径-Traveling salesman problem: two-dimensional coordinates of the national capital as shown in Figure 30, based on genetic algorithm design from Heilongjiang to
TabuSearch
- 禁忌搜索算法程序，完全解决了旅行商最短路径问题-Tabu search algorithm, completely solve the traveling salesman problem shortest path
tsp
- 用遗传算法求解旅行商问题，输出最短路径的最短路径长度。-Genetic Algorithm for Traveling Salesman problem, the output shortest path length of the shortest path.
Prim
- 用于求解旅行商最短路径问题的Prim算法，是一种经典的构造型算法，可用于论文实验的对比参照-Prim shortest path algorithm is used to solve the traveling salesman problem, is a classic stereotype algorithm can be used to compare the experimental reference papers。
tsp
- 关于旅行商问题求解最短路径的程序设计，本程序很好解决TSP问题的算法-About Traveling Salesman Problem solving the shortest path programming, this program is a good algorithm to solve TSP problem
sa
- 本程序是运用模拟退火算法解决旅行商问题，求解最短路径，C语言程序-This procedure is to use simulated annealing algorithm to solve the traveling salesman problem, solving the shortest path, C language program
lvxingshang.java
- 用java语言开发基于遗传算法理论的旅行商最短路径问题，包含遗传算法的常用基本理论。-The basic theory of common java language development based on the traveling salesman problem based on genetic theory shortest path algorithms, including genetic algorithm.
genetic-algorithm-TSP
- 遗传算法求解随机生成城市的最短路径问题即旅行商问题，同时生成路径图-a solution to TSP problem based on genetic algorithm
ACATSP
- 旅行商问题，常被称为旅行推销员问题，是指一名推销员要拜访多个地点时，如何找到在拜访每个地点一次后再回到起点的最短路径。规则虽然简单，但在地点数目增多后求解却极为复杂-Salesman problem, often referred to as the traveling salesman problem, refers to a salesman when you want to visit multiple locations, ho
The-ant-colony-algorithm
- 蚁群算法，解决了旅行商问题的最短路径，优化了路径问题-Ant colony algorithm to solve the traveling salesman problem shortest path to optimize the routing problem
GA_solve_TSP
- 遗传算法解决旅行商问题，文件读入城市数量，城市名称，坐标。输出为最短路径的城市序列以及路径距离。-Genetic algorithm to solve the traveling salesman problem, read the file into the number of cities, city name, coordinates. Output sequence for the city as well as the sho
Genetic-Algorithm-TSP
- 使用遗传算法解决旅行商问题，matlab程序，寻找最短路径，智能优化算法课程-the solution to TSP by Genetic Algorithm
anti_TSP
- 蚁群算法是一种智能优化算法，通过介绍蚁群觅食过程中基于信息素的最短路径的搜索策略，给出基于MATLAB的蚁群算法在旅行商问题中的源代码m文件，对问题求解进行局部优化。-Ant colony algorithm is an intelligent optimization algorithm through the shortest route of pheromone search strategy based on the ant f
TSP
- 矩阵实验室求解最短路径，旅行商问题，车辆路径问题-matlab TSP
matlab_tps_solve
- 使用蚁群算法，对旅行商最短路径求解的TPS问题求解，经测试后，无误！matlab程序代码-Using ant colony algorithm, the traveling salesman shortest path to solve TPS problem solving, after testing, correct! Matlab program code
TPS_Solve_Problem
- 对旅行商最短路径的TPS经典问题求解，研究生课程《控制理论及其应用》课本里的原书matlab程序代码。-The TSP shortest path to the classic TPS problem solving, the course control theory and its application in the original book matlab code.
TSP
- 基于连续HP网络的TSP问题。根据Hopfield神经网络相关知识，得到旅行商最短路径。本例程解决的是一个城市数量为10的TSP问题，城市位置在图上用坐标表示。-TSP problem based on continuous HP network.