Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers

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

Transportation Science, 1988, vol. 22, issue 2, 148-154

Abstract: This paper deals with the following routing problem: on any given day a subset of k out of n nodes of a network require a service visit (0 (le) k (le) n ). Each node of the network can generate a request with a given probability. The problem is to find an a priori tour with a minimum expected length through the n nodes such that any k given nodes will be visited in the same order they appear in the a priori tour. In contrast to other work, the probabilities of placing a demand at the different nodes are allowed to differ one from the other. Also discussed is the problem of finding the optimal home location (origin) for the service unit.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.2.148 (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:22:y:1988:i:2:p:148-154

Access Statistics for this article

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