A Parallel Algorithm for the Vehicle Routing Problem
Journal Article
·
· INFORMS Journal on Computing
- ORNL
- University of Maryland
- American University
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.
- Research Organization:
- Oak Ridge National Laboratory (ORNL)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1110893
- Journal Information:
- INFORMS Journal on Computing, Journal Name: INFORMS Journal on Computing Journal Issue: 2 Vol. 23; ISSN 1091-9856
- Country of Publication:
- United States
- Language:
- English
Similar Records
New exact algorithms for the vehicle routing problem
Computational experience with simulated trading algorithms solving vehicle routing and other combinatorial optimization problems
A Library of Local Search Heuristics for the Vehicle Routing Problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36283
Computational experience with simulated trading algorithms solving vehicle routing and other combinatorial optimization problems
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35796
A Library of Local Search Heuristics for the Vehicle Routing Problem
Journal Article
·
Thu Dec 31 23:00:00 EST 2009
· Mathematical Programming Computation
·
OSTI ID:979334