A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem

DOI10.1016/0305-0548(95)00052-6zbMath0854.90060OpenAlexW1999658852MaRDI QIDQ1919781

Benjamin Thomas, Charles E. Noon, Melissa R. Bowers

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

zbMATH Keywords

decompositionvehicle routingparallel implementationparallelization strategymultiple processor computers

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Parallel numerical computation (65Y05)

Related Items (1)

A stabilized column generation scheme for the traveling salesman subtour problem

Uses Software

• VRP

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

This page was built for publication: A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem