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

DOI10.1016/0305-0548(95)00052-6MaRDI QIDQ1919781zbMATH OpenOpenAlexFDO

Authors Charles E. Noon, Benjamin Thomas, 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

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

Recommendations

• A parallel algorithm for the vehicle routing problem
• Parallel solution methods for vehicle routing problems
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A parallel algorithm for the vehicle routing problem with time window constraints

Cites work

• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A Lagrangean relaxation heuristic for vehicle routing
• A TSSP+1 decomposition strategy for the vehicle routing problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A generalized exchange heuristic for the capacitated vehicle routing problem
• An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Implementing an insertion heuristic for vehicle routing on parallel hardware
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Parallel iterative search methods for vehicle routing problems

Cited in

(3)

• Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
• A stabilized column generation scheme for the traveling salesman subtour problem
• Parallel solution methods for vehicle routing problems

Describes a project that uses

Uses Software

• VRP

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

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