A Parallel Algorithm for the Vehicle Routing Problem
Chris Groër, Bruce Golden, Edward Wasil
INFORMS Journal on Computing · 2011 · Volume 23 · Issue 2
Abstract
The vehicle routing problem (VRP) is a difficult 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 find high-quality solutions to standard benchmark problems. We assess the impact of parallelism by analyzing our procedure's performance under a number of different scenarios.
Keywords
vehicle routing, optimization, heuristics, metaheuristics, parallel computing
Enable JavaScript for citation tools and additional paper interactions.