A note on single alternating cycle neighborhoods for the TSP

DOI10.1007/s10732-005-0713-6zbMath1122.90399OpenAlexW2064704921MaRDI QIDQ2573008

Birger Funke, Stefan Irnich, Tore Grünert

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

TSPlocal searchejection chainsLin-Kernighanedge-exchange neighborhoods

Mathematics Subject Classification ID

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

Related Items (6)

Traveling salesman problem heuristics: leading methods, implementations and latest advances ⋮ Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• The traveling salesman problem and its variations
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• Fast Algorithms for Geometric Traveling Salesman Problems
• Data Structures for Traveling Salesmen
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

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