IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v36y1988i3p478-484.html
   My bibliography  Save this article

A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks

Author

Listed:
  • David Simchi-Levi

    (Columbia University, New York, New York)

  • Oded Berman

    (University of Massachusetts, Boston, Massachusetts)

Abstract

In this paper, we present a heuristic for the traveling salesman location problem on a network. Each day the salesman (e.g., a repair vehicle) must visit 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. The heuristic requires O ( n 3 ) time to find the location that “minimizes” the expected distance traveled. A worst case analysis of the heuristic indicates that it will produce a solution which is at most 50% worse than the optimal solution. The paper also contains several asymptotic results for the problem in the plane.

Suggested Citation

  • David Simchi-Levi & Oded Berman, 1988. "A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks," Operations Research, INFORMS, vol. 36(3), pages 478-484, June.
    • Handle: RePEc:inm:oropre:v:36:y:1988:i:3:p:478-484
    DOI: 10.1287/opre.36.3.478
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.36.3.478
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.36.3.478?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
    ---><---

    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:oropre:v:36:y:1988:i:3:p:478-484. 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.