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

Technical Note—Analysis of a Preference Order Traveling Salesman Problem

Author

Listed:
  • Moshe Sniedovich

    (National Research Institute for Mathematical Sciences, Pretoria, South Africa)

Abstract

Application is made to the preference order dynamic programming solution procedure proposed by Kao for a stochastic traveling salesman problem. Although the procedure is flawed from the myopic interpretation of the monotonicity condition, it may be used as a convenient heuristic tool for solving stochastic problems.

Suggested Citation

  • Moshe Sniedovich, 1981. "Technical Note—Analysis of a Preference Order Traveling Salesman Problem," Operations Research, INFORMS, vol. 29(6), pages 1234-1237, December.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:6:p:1234-1237
    DOI: 10.1287/opre.29.6.1234
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.6.1234
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.6.1234?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. Elgesem, Aurora Smith & Skogen, Eline Sophie & Wang, Xin & Fagerholt, Kjetil, 2018. "A traveling salesman problem with pickups and deliveries and stochastic travel times: An application from chemical shipping," European Journal of Operational Research, Elsevier, vol. 269(3), pages 844-859.
    3. Astrid S. Kenyon & David P. Morton, 2003. "Stochastic Vehicle Routing with Random Travel Times," Transportation Science, INFORMS, vol. 37(1), pages 69-82, February.

    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:29:y:1981:i:6:p:1234-1237. 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.