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

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

Author

Listed:
  • S. Lin

    (Bell Telephone Laboratories, Incorporated, Murray Hill, New Jersey)

  • B. W. Kernighan

    (Bell Telephone Laboratories, Incorporated, Murray Hill, New Jersey)

Abstract

This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems. The procedure produces optimum solutions for all problems tested, “classical” problems appearing in the literature, as well as randomly generated test problems, up to 110 cities. Run times grow approximately as n 2 ; in absolute terms, a typical 100-city problem requires less than 25 seconds for one case (GE635), and about three minutes to obtain the optimum with above 95 per cent confidence.

Suggested Citation

  • S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    • Handle: RePEc:inm:oropre:v:21:y:1973:i:2:p:498-516
    DOI: 10.1287/opre.21.2.498
    as

    Download full text from publisher

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

    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:21:y:1973:i:2:p:498-516. 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.