Location:
Search - tsp dynamic c
Search list
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: 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: TSP问题的动态规化求解方法 TSP 问题的动态规化求解方法 -TSP problem of dynamic regulation of TSP problem solving method of the dynamic regulation method
Platform: |
Size: 3072 |
Author: |
Hits:
Description: 单向的TSP旅行商问题的动态规划算法，用C语言实现。-One-way Traveling Salesman Problem TSP dynamic programming algorithm, using C language.
Platform: |
Size: 1024 |
Author: zhoulitc |
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: 用动态规划法求解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: 使用C++ 实现的，利用动态规划算解决旅行商问题-solving TSP problem with dynamic programming in C++
Platform: |
Size: 18432 |
Author: EA |
Hits:
Description: 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 computing network longest shortest route. C Traveling Salesman Bound algorithm. C Knight Dijkstra shortest path algorithm for traversing the network. C
Platform: |
Size: 20480 |
Author: swikon |
Hits:
Description: 利用动态规划思想，求货郎担问题，采用C++，显示各结点的路径并求出最短距离-The use of dynamic programming ideas, seeking traveling salesman problem, using C++, showing the node' s path and find the shortest distance
Platform: |
Size: 10240 |
Author: mr wu |
Hits:
Description: 动态规划关于旅行商问题的C++实现源代码。-On the traveling salesman problem dynamic programming C++ implementation source code. 11111111
Platform: |
Size: 1104896 |
Author: chyl |
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:
Description: Travelling Salesman Problem (TSP) with Dynamic Programming in C
Platform: |
Size: 17408 |
Author: MostafaSalehi
|
Hits: