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

The Capacitated Traveling Salesman Location Problem

Author

Listed:
  • David Simchi-Levi

    (Columbia University, New York, New York)

Abstract

The capacitated traveling salesmen location problem is the problem of locating one service station with servers, each having a limited capacity, q . The service units must visit each day 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. In the paper we present an O ( n 3 ) time heuristic for the problem on networks. This heuristic finds a solution whose relative worst-case error equals 3 /2−3/(2 q ). We also show how one can use this heuristic to solve the problem on the plane with rectilinear or Euclidean distances with the same worst-case error. In the latter case the heuristic is proved to be asymptotically optimal.

Suggested Citation

  • David Simchi-Levi, 1991. "The Capacitated Traveling Salesman Location Problem," Transportation Science, INFORMS, vol. 25(1), pages 9-18, February.
    • Handle: RePEc:inm:ortrsc:v:25:y:1991:i:1:p:9-18
    DOI: 10.1287/trsc.25.1.9
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.25.1.9
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.25.1.9?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. Martin Schwardt & Kathrin Fischer, 2009. "Combined location-routing problems—a neural network approach," Annals of Operations Research, Springer, vol. 167(1), pages 253-269, March.
    2. Luca Bertazzi & Francesca Maggioni, 2015. "Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 321-342, July.
    3. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    4. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.

    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:25:y:1991:i:1:p:9-18. 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.