A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem
From MaRDI portal
Publication:1919781
DOI10.1016/0305-0548(95)00052-6zbMath0854.90060MaRDI QIDQ1919781
Melissa R. Bowers, Charles E. Noon, Benjamin Thomas
Publication date: 1996
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(95)00052-6
decomposition; vehicle routing; parallel implementation; parallelization strategy; multiple processor computers
Related Items
Uses Software
Cites Work
- A Lagrangean relaxation heuristic for vehicle routing
- Implementing an insertion heuristic for vehicle routing on parallel hardware
- A TSSP+1 decomposition strategy for the vehicle routing problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
- Parallel iterative search methods for vehicle routing problems
- A generalized exchange heuristic for the capacitated vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem