Journal
MATHEMATICAL PROGRAMMING COMPUTATION
Volume 2, Issue 2, Pages 79-101Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s12532-010-0013-5
Keywords
Vehicle routing; Optimization; Heuristics; Metaheuristics
Categories
Funding
- American University
Ask authors/readers for more resources
The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allows one to quickly generate solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, straightforward to compile, and is freely available online. The code contains several applications that can be used to generate solutions to the capacitated VRP. Computational results indicate that these applications are able to generate solutions that are within about one percent of the best-known solution on benchmark problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available