A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs

DOI10.1007/s12597-012-0088-zzbMath1353.90162MaRDI QIDQ505141

Ravindra S. Gajulapalli, Sumanta Basu, Diptesh Ghosh

Publication date: 19 January 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-012-0088-z

zbMATH Keywords

tabu search; data structures; asymmetric traveling salesman problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• TSPLIB
• Concorde
• SPARSKIT
• Tabu search