DOE OSTI · 1110893
A Parallel Algorithm for the Vehicle Routing Problem
Abstract
The vehicle routing problem (VRP) is a dicult and well-studied combinatorial optimization problem. We develop a parallel algorithm for the VRP that combines a heuristic local search improvement procedure with integer programming. We run our parallel algorithm with as many as 129 processors and are able to quickly nd high-quality solutions to standard benchmark problems. We assess the impact of parallelism by analyzing our procedure's performance under a number of dierent scenarios.
Keep this discovery
Explore connections, maps & timelines
Groer, Christopher S, Golden, Bruce, Edward, Wasil. 2011-01-01. A Parallel Algorithm for the Vehicle Routing Problem. https://doi.org/10.1287/ijoc.1100.0402
Cite the original work for its findings. Save a collection to share your selection of sources.