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

The Traveling Salesman Location Problem

Author

Listed:
  • Robert C. Burness

    (Ethyl Corporation, Baton Rouge, Louisiana)

  • John A. White

    (Georgia Institute of Technology, Atlanta, Georgia)

Abstract

The problem of locating a single new facility relative to m existing facilities has been studied extensively under the assumption that trips are always made between the new facility and a single existing facility each time a trip occurs. A variation of the problem is the traveling salesman location problem, which involves a traveling salesman who services m customers. Each time a trip occurs the salesman visits one or more customers during the trip. Thus, 2 m - 1 different itineraries can be formed, each occurring with a given probability. The new facility, which is the starting and ending point of each itinerary, is to be located such that the expected distance traveled per unit time is minimized. An iterative procedure is presented for solving the traveling salesman location problem; computational experience with the procedure is provided.

Suggested Citation

  • Robert C. Burness & John A. White, 1976. "The Traveling Salesman Location Problem," Transportation Science, INFORMS, vol. 10(4), pages 348-360, November.
    • Handle: RePEc:inm:ortrsc:v:10:y:1976:i:4:p:348-360
    DOI: 10.1287/trsc.10.4.348
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.10.4.348
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.10.4.348?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. Saïd Salhi & Gábor Nagy, 2009. "Local improvement in planar facility location using vehicle routing," Annals of Operations Research, Springer, vol. 167(1), pages 287-296, March.
    2. Igor Averbakh & Wei Yu, 2020. "Multi-depot traveling salesmen location problems on networks with special structure," Annals of Operations Research, Springer, vol. 286(1), pages 635-648, March.
    3. O Berman & Z Drezner & G O Wesolowsky, 2008. "The multiple location of transfer points," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 805-811, June.
    4. 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.
    5. 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.
    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. Drezner, Zvi & Wesolowsky, George O., 2001. "On the collection depots location problem," European Journal of Operational Research, Elsevier, vol. 130(3), pages 510-518, May.
    8. 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.
    9. Bertsimas, Dimitris, 1988. "Two traveling salesman facility location problems," Working papers 2068-88., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    10. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    11. Berman, Oded & Drezner, Zvi & Wesolowsky, George O., 2007. "The transfer point location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 978-989, June.
    12. Bertsimas, Dimitris. & Jaillet, Patrick. & Odoni, Amedeo R., 1989. "A priori optimization," Working papers 3059-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    13. 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.

    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:10:y:1976:i:4:p:348-360. 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.