Description: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes Platform: |
Size: 3072 |
Author:郎风华 |
Hits:
Description: 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its description of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path Platform: |
Size: 3072 |
Author:ron |
Hits:
Description: 使用模拟退火算法求解TSP（旅行商）问题的JAVA源程序-The use of simulated annealing algorithm for solving TSP (traveling salesman) problem with JAVA source Platform: |
Size: 3072 |
Author:ann |
Hits:
Description: 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its description of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path Platform: |
Size: 3072 |
Author:hbk hsu |
Hits:
Description: tsp的java源码实现旅行商问题，即TSP问题（Traveling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(The Java source of TSP is one of the famous problems in the field of mathematics, that is, the TSP problem (Traveling Salesman Problem), which is also translated as travel salesman problem and cargo carrier problem. Suppose a traveler wants to visit a n city. He has to choose the way he wants to go. The limit of the path is that each city can visit only once, and finally it will return to the original city. The goal of path selection is to obtain the minimum path of all paths.) Platform: |
Size: 1024 |
Author:tomorrow1 |
Hits:
Search - java traveling salesman problem source