A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
From MaRDI portal
Publication:505141
DOI10.1007/S12597-012-0088-ZzbMath1353.90162OpenAlexW2054875464MaRDI QIDQ505141
Diptesh Ghosh, Ravindra S. Gajulapalli, Sumanta Basu
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- The traveling salesman problem and its variations
- Solving the vehicle routing problem with adaptive memory programming methodology
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A concise guide to the Traveling Salesman Problem
- Local Search for the Asymmetric Traveling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- Tabu Search—Part I
- Tabu Search—Part II
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- Reducibility among Combinatorial Problems
This page was built for publication: A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
