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

DOI10.1016/J.EJOR.2004.04.023MaRDI QIDQ1887873zbMATH OpenOpenAlexWikidataFDO

Authors Dorabela Gamboa, Fred Glover, 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

Data structuresLocal searchTraveling salesmanEjection chains

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 437539
• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• Data Structures for Traveling Salesmen
• Relaxed tours and path ejections for the traveling salesman problem
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem

Cites work

• scientific article; zbMATH DE number 2064412 (Why is no real title available?)
• A data structure useful for finding Hamiltonian cycles
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• Data Structures for Traveling Salesmen
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• Relaxed tours and path ejections for the traveling salesman problem
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(14)

• Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
• Social structure optimization in team formation
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• Further extension of the TSP assign neighborhood
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• scientific article; zbMATH DE number 437539 (Why is no real title available?)
• Data Structures for Traveling Salesmen
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
• A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
• A \(k\)-level data structure for large-scale traveling salesman problems
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP

Describes a project that uses

Uses Software

• TSPLIB
• DIMACS

This page was built for publication: Data structures and ejection chains for solving large-scale traveling salesman problems

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