A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks

David Simchi-Levi and Oded Berman
Additional contact information
David Simchi-Levi: Columbia University, New York, New York
Oded Berman: University of Massachusetts, Boston, Massachusetts

Operations Research, 1988, vol. 36, issue 3, 478-484

Abstract: In this paper, we present a heuristic for the traveling salesman location problem on a network. Each day the salesman (e.g., a repair vehicle) must visit all the calls that are registered in a service list. Each call is generated with a given probability and the service list contains at most n calls. The heuristic requires O ( n 3 ) time to find the location that “minimizes” the expected distance traveled. A worst case analysis of the heuristic indicates that it will produce a solution which is at most 50% worse than the optimal solution. The paper also contains several asymptotic results for the problem in the plane.

Keywords: facilities/equipment planning: location of a traveling salesman; networks/graphs: location on networks; heuristics for the location of a traveling salesman (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (26)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.3.478 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:36:y:1988:i:3:p:478-484

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().