An Effective Heuristic Algorithm for the Traveling-Salesman Problem

• S. Lin

  Bell Telephone Laboratories, Incorporated, Murray Hill, New Jersey

• B. W. Kernighan

  Bell Telephone Laboratories, Incorporated, Murray Hill, New Jersey

抄録

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.

収録刊行物

• Operations Research

  Operations Research 21 (2), 498-516, 1973-04

  Institute for Operations Research and the Management Sciences (INFORMS)

キーワード

• Management Science and Operations Research
• Computer Science Applications

詳細情報

• CRID: 1360292620969204224
• NII論文ID: 30041574372
• DOI: 10.1287/opre.21.2.498
• ISSN: 15265463
• ISSN: 0030364X
• ISSN: http://id.crossref.org/issn/03990559
• Web Site: https://pubsonline.informs.org/doi/pdf/10.1287/opre.21.2.498
• データソース種別:
  • Crossref
  • CiNii Articles