The Traveling Salesman Location Problem

Robert C. Burness and John A. White
Additional contact information
Robert C. Burness: Ethyl Corporation, Baton Rouge, Louisiana
John A. White: Georgia Institute of Technology, Atlanta, Georgia

Transportation Science, 1976, vol. 10, issue 4, 348-360

Abstract: The problem of locating a single new facility relative to m existing facilities has been studied extensively under the assumption that trips are always made between the new facility and a single existing facility each time a trip occurs. A variation of the problem is the traveling salesman location problem, which involves a traveling salesman who services m customers. Each time a trip occurs the salesman visits one or more customers during the trip. Thus, 2 m - 1 different itineraries can be formed, each occurring with a given probability. The new facility, which is the starting and ending point of each itinerary, is to be located such that the expected distance traveled per unit time is minimized. An iterative procedure is presented for solving the traveling salesman location problem; computational experience with the procedure is provided.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.10.4.348 (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:ortrsc:v:10:y:1976:i:4:p:348-360

Access Statistics for this article

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