Description: 旅行售货员问题的解是一棵排列树.在给出的图中寻找一条费用最优的回路-travel salesman problem is the solution with a tree. The plan is to find an optimal cost of the Loop Platform: |
Size: 1946 |
Author:姚翊 |
Hits:
Description: 旅行售货员问题的解是一棵排列树.在给出的图中寻找一条费用最优的回路-travel salesman problem is the solution with a tree. The plan is to find an optimal cost of the Loop Platform: |
Size: 2048 |
Author:姚翊 |
Hits:
Description: 用模拟退火算法求解旅行商问题,其中用STL中的Vector来实现路径的存放 -simulated annealing algorithm for the traveling salesman problem, which use the STL Vector to achieve the storage path Platform: |
Size: 117760 |
Author:田园 |
Hits:
Description: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value -this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value Platform: |
Size: 4096 |
Author:宏姬 |
Hits:
Description: 旅行商问题:
某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。-traveling salesman problem : 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: 56320 |
Author:章为到 |
Hits:
Description: 旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
-Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business 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: 1231872 |
Author:吴昆 |
Hits:
Description: Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Platform: |
Size: 3072 |
Author:阳关 |
Hits:
Description: Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases. Platform: |
Size: 446464 |
Author:yangdi |
Hits:
Description: c语言程序 旅游售货员问题 实验报告~区域交通网中顶点的数据域在这里不是我们关心的内容,我们关心的只是连接2个顶点的弧的代价。由于涉及到顶点间边或狐,我们可以用一个二维数组存放顶点间关系(边或弧)的数据――邻接矩阵实现该区域交通网的存储。-c language program travel salesman problem Experimental Report ~ regional transportation network in the vertex of the data field here is not our concern, we care about is connecting two vertices arc price. As it relates to inter-vertex edge or fox, we can use a two-dimensional array storing the relationship between the vertex (edge or arc) data- adjacency matrix to achieve the region s transportation network storage. Platform: |
Size: 22528 |
Author:烟雨 |
Hits:
Description: 遗传算法和“货郎担” 问题:
"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point." -Genetic algorithm and the Platform: |
Size: 283648 |
Author:s050403054 |
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++平台下,用分支限界法和回溯法实现的旅行售货员问题。经本人测试运行无误,包括运行文档。-In vc++ Platform, using branch and bound and backtracking realize the travel salesman problem. After I run the correct tests, including the operation of the document. Platform: |
Size: 264192 |
Author:you shiming |
Hits: