A k-level data structure for large-scale traveling salesman problems

DOI10.1007/S10479-016-2159-7MaRDI QIDQ512957zbMATH OpenOpenAlexFDO

Authors Colin Osterman, César Rego

Publication date 3 March 2017

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-016-2159-7

zbMATH Keywords

algorithmscombinatorial optimizationdata structurestraveling salesman problemejection chains

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 437539
• The traveling salesman problem: An overview of exact and approximate algorithms
• Data Structures for Traveling Salesmen
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Data structures and ejection chains for solving large-scale traveling salesman problems

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A data structure useful for finding Hamiltonian cycles
• A subpath ejection method for the vehicle routing problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• Data Structures for Traveling Salesmen
• Data structures and ejection chains for solving large-scale traveling salesman problems
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• Relaxed tours and path ejections for the traveling salesman problem
• Self-adjusting binary search trees
• TSP ejection chains
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP

Cited in

(3)

• Global versus local search: the impact of population sizes on evolutionary algorithm performance
• scientific article; zbMATH DE number 437539 (Why is no real title available?)
• Data Structures for Traveling Salesmen

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: A \(k\)-level data structure for large-scale traveling salesman problems

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