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

The Traveling Salesman Location Problem on Stochastic Networks

Author

Listed:
  • Oded Berman

    (College of Management, The University of Massachusetts-Harbor Campus, Boston, Massachusetts 02125-3393)

  • David Simchi-Levi

    (Columbia University, New York, New York 10027)

Abstract

In this note, we consider the traveling salesman location problem on stochastic networks in which the length of links are not deterministic. In particular, we show that several available solution methods for deterministic networks can be modified to solve the problem on stochastic networks as well.

Suggested Citation

  • Oded Berman & David Simchi-Levi, 1989. "The Traveling Salesman Location Problem on Stochastic Networks," Transportation Science, INFORMS, vol. 23(1), pages 54-57, February.
    • Handle: RePEc:inm:ortrsc:v:23:y:1989:i:1:p:54-57
    DOI: 10.1287/trsc.23.1.54
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.23.1.54
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.23.1.54?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. Zhouchun Huang & Qipeng Phil Zheng & Eduardo Pasiliao & Vladimir Boginski & Tao Zhang, 2019. "A cutting plane method for risk-constrained traveling salesman problem with random arc costs," Journal of Global Optimization, Springer, vol. 74(4), pages 839-859, August.
    2. Astrid S. Kenyon & David P. Morton, 2003. "Stochastic Vehicle Routing with Random Travel Times," Transportation Science, INFORMS, vol. 37(1), pages 69-82, February.
    3. Zhouchun Huang & Qipeng P. Zheng & Eduardo L. Pasiliao & Daniel Simmons, 2017. "Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios," Annals of Operations Research, Springer, vol. 249(1), pages 141-162, February.
    4. Jian Yang & Patrick Jaillet & Hani Mahmassani, 2004. "Real-Time Multivehicle Truckload Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 38(2), pages 135-148, May.

    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:23:y:1989:i:1:p:54-57. 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.