The Traveling Repairperson Home Base Location Problem

Mamnoon Jamil, Rajan Batta and David M. Malon
Additional contact information
Mamnoon Jamil: School of Business, Rutgers University, Camden, New Jersey 08102
Rajan Batta: Department of Industrial Engineering, State University of New York at Buffalo, Buffalo, New York 14260
David M. Malon: Argonne National Laboratory, Argonne, Illinois 60439

Transportation Science, 1994, vol. 28, issue 2, 150-161

Abstract: This paper considers the problem of locating the home base of a traveling server on a network. Calls for service arrive solely at nodes via independent, time-homogeneous Poisson processes. Calls finding the server busy enter a finite capacity queue which is depleted in a First-Come-First-Served (FCFS) manner. The server travels from his/her home base serving calls back-to-back, returning home only when he/she finds the system empty upon the completion of a service. The objective we consider is to minimize the average response time to an accepted call. The queueing system is analyzed via a busy period analysis, which uses a decoupling scheme to simplify the task of optimizing the home base location. Computational experience is discussed and a numerical example is presented. Generalizations of the model are also discussed.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.28.2.150 (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:28:y:1994:i:2:p:150-161

Access Statistics for this article

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