Data structures and ejection chains for solving large-scale traveling salesman problems

DOI10.1016/j.ejor.2004.04.023zbMath1067.90140OpenAlexW2161772518WikidataQ56017139 ScholiaQ56017139MaRDI QIDQ1887873

Fred Glover, Dorabela Gamboa, César Rego

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.023

zbMATH Keywords

Traveling salesmanData structuresLocal searchEjection chains

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Social structure optimization in team formation, Traveling salesman problem heuristics: leading methods, implementations and latest advances, Ejection chain and filter-and-fan methods in combinatorial optimization, A \(k\)-level data structure for large-scale traveling salesman problems, Ejection chain and filter-and-fan methods in combinatorial optimization, Further extension of the TSP assign neighborhood, Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP, A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP, Implementation analysis of efficient heuristic algorithms for the traveling salesman problem

Uses Software

• TSPLIB
• DIMACS

Cites Work

• Unnamed Item
• A data structure useful for finding Hamiltonian cycles
• Relaxed tours and path ejections for the traveling salesman problem
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• TSPLIB—A Traveling Salesman Problem Library
• Data Structures for Traveling Salesmen
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem