A note on single alternating cycle neighborhoods for the TSP

DOI10.1007/S10732-005-0713-6MaRDI QIDQ2573008zbMATH OpenOpenAlexFDO

Authors Birger Funke, Tore Grünert, Stefan Irnich

Publication date 7 November 2005

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10732-005-0713-6

zbMATH Keywords

edge-exchange neighborhoodsejection chainsLin-Kernighanlocal searchTSP

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On the neighborhood structure of the traveling salesman problem generated by local search moves
• scientific article; zbMATH DE number 1003245
• Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
• Large-step Markov chains for the TSP incorporating local search heuristics
• Traveling salesman problem heuristics: leading methods, implementations and latest advances

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Chained Lin-Kernighan for large traveling salesman problems
• Data Structures for Traveling Salesmen
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Fast Algorithms for Geometric Traveling Salesman Problems
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 2064411 (Why is no real title available?)
• scientific article; zbMATH DE number 2064412 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• The traveling salesman problem and its variations

Cited in

(8)

• A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
• Fast local search algorithms for the handicapped persons transportation problem
• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• TSP with neighborhoods of varying size
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems

This page was built for publication: A note on single alternating cycle neighborhoods for the TSP

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