Article

Free access

New results on the old k-opt algorithm for the TSP

Authors:

Barun Chandra,

Howard Karloff,

Craig ToveyAuthors Info & Claims

SODA '94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Pages 150 - 159

Published: 23 January 1994 Publication History

PDF eReader

References

[1]

N. Alon and Y. Azar, "On-line Steiner Trees in the Eucfidean Plane," 8th Annual A CM Symposium on Computational Geometry (1992), 337-343.

Digital Library

Google Scholar

[2]

J. Bentley and J. Saxe, "An Analysis of Two Heuristics for the Eucfidean Traveling Salesman Problem," Eighteenth Annual Allerton Conference on Communication, Control and Computing (1980), 41-49.

Google Scholar

[3]

B. BoUob~s, Extremal Graph Theory, Academic Press, London, 1978.

Google Scholar

[4]

M. Bern, and D. Eppstein, "Worst-Case Bounds for Subadditive Geometric Graphs," 9th Annual A CM Symposium on Computational Geometry (1993).

Digital Library

Google Scholar

[5]

B. Chandra, G. Das, G. N arasimhan, and J. Soares, "New Sparseness Results on Graph Spanners," 8th Annual A CM Symposium on Computational Geometry (1992), 192-201.

Digital Library

Google Scholar

[6]

L. K. Grover, "Local Search and the Local Structure of NP-complete Problems," Operations Research Letters 12 (1992), 235-243.

Google Scholar

[7]

D. J. Johnson, C. H. Papadimitriou, M. Yannakakis, "How Easy is Local Search?", JCSS 37 (1988), 79-100.

Digital Library

Google Scholar

[8]

R. M. Karp and J. M. Steele, "Probabilistic Analysis of Heuristics," in E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, The Traveling Salesman Problem, John Wiley and Sons, 1985, 181-205.

Google Scholar

[9]

W. Kern, "A Probabilistic Analysis of the Switching Algorithm for the Euclidean TSP," Mathematical Programming 44 (1989), 213-219.

Digital Library

Google Scholar

[10]

M. W. Krentel, "Structure in Locally Optimal Solutions," 30th IEEE Symposium on the Foundations of Computer Science (1989), 216-221.

Google Scholar

[11]

M. W. Krentel, private communication.

Google Scholar

[12]

E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, The Traveling Salesman Problem, John Wiley and Sons, 1985.

Google Scholar

[13]

G. Lueker, manuscript, Princeton University, Princeton, N J, 1975.

Google Scholar

[14]

C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice- Hall, Englewood Cliffs, NJ, 1982.

Digital Library

Google Scholar

[15]

J. Plesnik, "Bad Examples of the Metric Traveling Salesman Problem for the 2-Change Heuristic," Acta Mathematica Universitatis Comenianae (1986), 203- 207.

Google Scholar

[16]

T. L. Snyder and J. M. Steele, "A Priori Inequalities for the Euclidean Traveling Salesman," 8th Annual A CM Symposium on Computational Geometry (1992), 344-349.

Digital Library

Google Scholar

Cited By

View all

Nallaperuma SNeumann FSudholt DArnold D(2014)A fixed budget analysis of randomized search heuristics for the traveling salesperson problemProceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2576768.2598302(807-814)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2576768.2598302
Khuller SBhatia RPless RShmoys D(2000)On local search and placement of meters in networksProceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms10.5555/338219.338268(319-328)Online publication date: 1-Feb-2000
https://dl.acm.org/doi/10.5555/338219.338268
Das GNarasimhan GSalowe JClarkson K(1995)A new way to weigh Malnourished Euclidean graphsProceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/313651.313697(215-222)Online publication date: 22-Jan-1995
https://dl.acm.org/doi/10.5555/313651.313697
Show More Cited By

Index Terms

New results on the old k-opt algorithm for the TSP
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical analysis
    1. Mathematical optimization
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Sorting and searching
    2. Mathematical optimization
  2. Randomness, geometry and discrete structures

Recommendations

Trip Itinerary Generation with 2-Opt Algorithm
AISS '22: Proceedings of the 4th International Conference on Advanced Information Science and System

Advances in digital technologies and communications are impacting how people travel. However, there are still lacking of personalised digital-based tools to support people in trip planning. Although there are a number of widely used trip planner ...
New TSP Construction Heuristics and Their Relationshipsto the 2-Opt

Correction heuristics for the traveling salesman problem (TSP), with the 2-Opt applied as a postprocess, are studied with respect to their tour lengths and computation times. This study analyzes the ’’2-Opt dependency,‘‘ which indicates how the performance ...
Average-case approximation ratio of the 2-opt algorithm for the TSP

We show that the 2-opt heuristic for the traveling salesman problem achieves an expected approximation ratio of roughly O(n) for instances with n nodes, where the edge weights are drawn uniformly and independently at random.

Comments

Information & Contributors

Information

Published In

SODA '94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

January 1994

735 pages

ISBN:0898713293

Chairman:
Daniel D. Sleator

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 23 January 1994

Check for updates

Qualifiers

Article

Conference

SODA94

Sponsor:

SIGACT
SIAM

SODA94: Conference on Discrete Algorithms

January 23 - 25, 1994

Virginia, Arlington, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
607
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)10

Reflects downloads up to 21 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nallaperuma SNeumann FSudholt DArnold D(2014)A fixed budget analysis of randomized search heuristics for the traveling salesperson problemProceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2576768.2598302(807-814)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2576768.2598302
Khuller SBhatia RPless RShmoys D(2000)On local search and placement of meters in networksProceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms10.5555/338219.338268(319-328)Online publication date: 1-Feb-2000
https://dl.acm.org/doi/10.5555/338219.338268
Das GNarasimhan GSalowe JClarkson K(1995)A new way to weigh Malnourished Euclidean graphsProceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/313651.313697(215-222)Online publication date: 22-Jan-1995
https://dl.acm.org/doi/10.5555/313651.313697
Halldórsson MClarkson K(1995)Approximating discrete collections via local improvementsProceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/313651.313687(160-169)Online publication date: 22-Jan-1995
https://dl.acm.org/doi/10.5555/313651.313687

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Trip Itinerary Generation with 2-Opt Algorithm

New TSP Construction Heuristics and Their Relationshipsto the 2-Opt

Average-case approximation ratio of the 2-opt algorithm for the TSP

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Trip Itinerary Generation with 2-Opt Algorithm

New TSP Construction Heuristics and Their Relationshipsto the 2-Opt

Average-case approximation ratio of the 2-opt algorithm for the TSP

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations