Description: 旅行商问题动态规划算法的应用
某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。
-TSP dynamic programming algorithm of a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. Platform: |
Size: 61863 |
Author:586 |
Hits:
Description: 旅行商问题动态规划算法的应用
某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。
-TSP dynamic programming algorithm of a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. Platform: |
Size: 61440 |
Author:586 |
Hits:
Description: 旅行商问题_数组实现
请设计出一个动态规划算法
程序设计
任给一个输入实例,能输出最短路程及其路线
能用图形演示旅行商的推销路线-Traveling Salesman Problem _ array to achieve, please design a dynamic programming algorithm to a program design any input example, can output the shortest distance and routes can be used to sell graphical presentation of the traveling salesman route Platform: |
Size: 116736 |
Author:战天 |
Hits:
Description: ga算法解tsp问题.动态TSP就是城市坐标在随着时间变化,我们的目标则要在最短的时间窗内寻找出最优的城市遍历路径,这是个双最优问题.
这是我对动态TSP算法的理解,使用改进的反序-杂交算法-ga algorithm problems tsp. dynamic TSP is that the town change over time in the coordinates, we aim to have in the shortest possible time window to find out the optimal path to traverse the city, this is a dual-optimal problem. This is my understanding of the dynamic TSP algorithm understanding, the use of improved anti-sequence- Hybrid Algorithm Platform: |
Size: 4096 |
Author:李丽 |
Hits:
Description: 用动态规划算法求解旅行商销售员问题,给出一个耗费矩阵,能够得出最短路径长度和最短路径。-Using dynamic programming algorithm to solve traveling salesman salesman problem, given a cost matrix, able to draw the shortest path length and the shortest path. Platform: |
Size: 2043904 |
Author:wu |
Hits:
Description: 利用模拟退火算法解决旅行商问题,共二十个城市,选择最优路径-The use of simulated annealing algorithm to solve traveling salesman problem Platform: |
Size: 55296 |
Author:wujian |
Hits:
Description: 用来实现tsp算法的动态模拟,很可能就是你的作业-Tsp algorithm used for dynamic simulation, it is possible that your operating Platform: |
Size: 3766272 |
Author:郭斌 |
Hits:
Description: 经典的基于GA遗传算法的路径规划问题的实现,能动态的实现所需功能,值得学习研究-The path planning problem of GA based on genetic algorithm classic, can realize the dynamic functions are required, it is worth learning research Platform: |
Size: 7168 |
Author:颜妍 |
Hits:
Description: 旅行商问题,用的是动态规划算法,需要自己输入结点和弧长,例如A B 3,表示A B 之间的弧长距离为3-Traveling salesman problem, using a dynamic programming algorithm, you need to enter your node and arc length, for example, AB 3, showing the arc between three distances AB Platform: |
Size: 2048 |
Author:刘丽 |
Hits:
Description: 这是一个关于著名最短路问题 旅行商问题的C++实现,本代码里面包含了两种实现方法:(1)动态规划求解TSP (2)蚁群算法求解TSP-This code is programed in C++ to solve TSP problem, which include two algorithm:(1)dynamic programming and (2)ant colony optimization Platform: |
Size: 3072 |
Author:chen |
Hits: