Location:
Search - dynamic TSP
Search list
Description: 货郎担问题！这是用动态规划实现的！ 效率很高啊！-traveling salesman problem! This is achieved using dynamic programming! High efficiency ah!
Platform: |
Size: 1024 |
Author: 王乐 |
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: 本程序利用动态规划的思想实现了经典的旅行商问题，程序中考虑为5个城市的情况。-This procedure using the idea of dynamic programming to achieve the classic traveling salesman problem, procedures to consider for the five cities.
Platform: |
Size: 206848 |
Author: dyzhao |
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: TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Description of the problem: traveling salesman problem, namely TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel businessmen to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
Platform: |
Size: 1045504 |
Author: 黄艺敏 |
Hits:
Description: 关于旅行商问题的动态规划算法 在vc环境下编译通过-On the traveling salesman problem dynamic programming algorithm in vc compiler environment through
Platform: |
Size: 591872 |
Author: 张小 |
Hits:
Description: 利用动态规划算法 vc实现的小规模旅行商问题-Vc algorithm using dynamic programming to achieve small-scale traveling salesman problem
Platform: |
Size: 1015808 |
Author: linmaitian |
Hits:
Description: TSP问题的动态规化求解方法 TSP 问题的动态规化求解方法 -TSP problem of dynamic regulation of TSP problem solving method of the dynamic regulation method
Platform: |
Size: 3072 |
Author: |
Hits:
Description: 求解TSP问题的动态邻域粒子群优化算法
（论文）-Solving dynamic TSP problem Neighborhood Particle Swarm Optimization (Thesis)
Platform: |
Size: 206848 |
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: 这是一个货郎担问题的动态规划代码,是C语言版的,能在TC上和VC++6.0上运行.加入了许多注释.-This is a traveling salesman problem dynamic programming code, is a C language version, can TC and VC++ 6.0 run. Adding a lot of notes.
Platform: |
Size: 2048 |
Author: zhoulitc |
Hits:
Description: 旅行商问题的动态规划解法 (XMU)-Traveling salesman problem dynamic programming method (XMU)
Platform: |
Size: 321536 |
Author: zhang |
Hits:
Description: tsp（旅行商问题） 利用matlab遗传算法、模拟退火算法以及lingo动态规划求解-tsp (TSP) using matlab genetic algorithms, simulated annealing algorithm and dynamic programming to solve lingo
Platform: |
Size: 11264 |
Author: 李玉 |
Hits:
Description: 用动态规划法求解TSP问题的C++源码 在Linux中用g++编译通过-Using dynamic programming method for solving TSP problems C++ Source code in Linux using g++ Compiled through
Platform: |
Size: 1024 |
Author: L.Zhang |
Hits:
Description: tsp动态规划解决旅行售货员问题 -tsp dynamic programming to solve the issue of travel salesman
Platform: |
Size: 2048 |
Author: 彭江涛 |
Hits:
Description: Dynamic Programming Code for the TSP
Platform: |
Size: 17408 |
Author: foxman |
Hits:
Description: 利用模拟退火算法解决旅行商问题，共二十个城市，选择最优路径-The use of simulated annealing algorithm to solve traveling salesman problem
Platform: |
Size: 55296 |
Author: wujian |
Hits:
Description: 回溯法，动态规划法，遗传算法求解
tsp问题（课程设计报告）-Backtracking, dynamic programming method, genetic algorithm tsp issues (curriculum design report)
Platform: |
Size: 2640896 |
Author: 曾亮 |
Hits:
Description: TSP问题(担货郎问题)的动态规划算法实现(Dynamic programming implementation of TSP problem)
Platform: |
Size: 663552 |
Author: monkeyking
|
Hits: