Fast marching methods for the continuous traveling salesman problem
We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points ('cities') in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a version of the Traveling Salesman Problem, in which an underlying known metric determines the cost of moving through each point of the domain, but in which the actual shortest path between cities is unknown at the outset. We describe algorithms for both a heuristic and an optimal solution to this problem. The order of the heuristic algorithm is at worst case M * N logN, where M is the number of cities, and N the size of the computational mesh used to approximate the solutions to the shortest paths problems. The average runtime of the heuristic algorithm is linear in the number of cities and O(N log N) in the size N of the mesh.
- Research Organization:
- Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US)
- Sponsoring Organization:
- Computational Research Division
- DOE Contract Number:
- AC02-05CH11231
- OSTI ID:
- 945046
- Report Number(s):
- LBNL-1313E
- Journal Information:
- Proceedings of the National Academy of Sciences, Journal Name: Proceedings of the National Academy of Sciences
- Country of Publication:
- United States
- Language:
- English
Similar Records
Exact parallel algorithms for some members of the traveling salesman problem family
Running time vs. tour quality for the traveling salesman problem