IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v28y1994i2p150-161.html
   My bibliography  Save this article

The Traveling Repairperson Home Base Location Problem

Author

Listed:
  • 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)

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.

Suggested Citation

  • Mamnoon Jamil & Rajan Batta & David M. Malon, 1994. "The Traveling Repairperson Home Base Location Problem," Transportation Science, INFORMS, vol. 28(2), pages 150-161, May.
    • Handle: RePEc:inm:ortrsc:v:28:y:1994:i:2:p:150-161
    DOI: 10.1287/trsc.28.2.150
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.28.2.150
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.28.2.150?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ahmadi-Javid, Amir & Amiri, Elahe & Meskar, Mahla, 2018. "A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 866-881.
    2. Havinga, Maik J.A. & de Jonge, Bram, 2020. "Condition-based maintenance in the cyclic patrolling repairman problem," International Journal of Production Economics, Elsevier, vol. 222(C).
    3. Parlar, Mahmut & Sharafali, Moosa & Ou, Jihong, 2006. "Optimal parking of idle elevators under myopic and state-dependent policies," European Journal of Operational Research, Elsevier, vol. 170(3), pages 863-886, May.
    4. Hunkar Toyoglu & Oya Ekin Karasan & Bahar Yetis Kara, 2011. "Distribution network design on the battlefield," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(3), pages 188-209, April.
    5. Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
    6. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    7. Jaller, Miguel & Pahwa, Anmol, 2023. "Coping with the Rise of E-commerce Generated Home Deliveries through Innovative Last-mile Technologies and Strategies," Institute of Transportation Studies, Working Paper Series qt5t76x0kh, Institute of Transportation Studies, UC Davis.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:28:y:1994:i:2:p:150-161. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.