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

Technical Note—An Effective Heuristic for the M -Tour Traveling Salesman Problem with Some Side Conditions

Author

Listed:
  • Robert A. Russell

    (University of Tulsa, Tulsa, Oklahoma)

Abstract

This note presents a heuristic for determining very good solutions for the symmetric M -tour traveling salesman problem with some side conditions. These side conditions' pertain to load, distance and time, or sequencing restrictions. The heuristic is an extension of the highly successful one of Lin and Kernighan for the single traveling salesman problem. Computational experience with widely tested vehicle dispatch problems indicates that the proposed heuristic consistently yields better solutions than existing heuristics that have appeared in the literature. Run times grow approximately as N 2.3 , where N is the number of cities. The heuristic is generally slower than the modified SWEEP heuristic except on problems having a large number of points per route.

Suggested Citation

  • Robert A. Russell, 1977. "Technical Note—An Effective Heuristic for the M -Tour Traveling Salesman Problem with Some Side Conditions," Operations Research, INFORMS, vol. 25(3), pages 517-524, June.
    • Handle: RePEc:inm:oropre:v:25:y:1977:i:3:p:517-524
    DOI: 10.1287/opre.25.3.517
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.25.3.517
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.25.3.517?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. W-C Chiang & R A Russell, 2004. "A metaheuristic for the vehicle-routeing problem with soft time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1298-1310, December.

    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:oropre:v:25:y:1977:i:3:p:517-524. 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.