Quick updates for p-opt TSP heuristics

DOI10.1016/0167-6377(92)90061-7MaRDI QIDQ1198624zbMATH OpenOpenAlexFDO

Authors François Margot

Publication date 16 January 1993

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(92)90061-7

zbMATH Keywords

exchange heuristicsLin-type \(p\)-opt exchangestraveling salesman

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1003245
• New TSP construction heuristics and their relationships to the 2-Opt
• New TSP construction heuristics and their relationships to the 2-Opt
• On the refinement of bounds of heuristic algorithms for the traveling salesman problem
• scientific article; zbMATH DE number 5855014
• Truly tight bounds for TSP heuristics
• Overview of new approaches for approximating TSP
• Fast Heuristics for Large Geometric Traveling Salesman Problems
• scientific article; zbMATH DE number 1703862
• The parallel complexity of TSP heuristics

Cites work

• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Probabilistic exchange algorithms and Euclidean traveling salesman problems

Cited in

(4)

• Genetic algorithms and traveling salesman problems
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• New TSP construction heuristics and their relationships to the 2-Opt
• Routing problems: A bibliography

This page was built for publication: Quick updates for \(p\)-opt TSP heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198624)