VRPH is an open-source library of heuristics for generating solutions to Vehicle Routing Problems (VRPs). The VRPH software includes the following:
- Many well-known heuristics for generating and improving feasible solutions to VRP instances (Clarke-Wright, two-opt, three-opt, etc.).
- Two metaheuristics that can usually generate good solutions to large instances containing hundreds of customer locations in a matter of seconds. On well-studied benchmark problems, the solutions are typically within a percent or two of the best-known solution.
- An algorithm that combines a metaheuristic with a set partitioning problem for even better solutions. This implementation currently uses the COIN Open Solver Interface (OSI) and the GLPK solver.
- A modular design that can be extended to handle additional constraints.
VRPH was developed by Chris Groer (cgroerATgmailDOTcom), currently at Oak Ridge National Lab
April 2009: VRPH-1.0.0 is released.
Click here to see the current change log.
- GNU/Linux (g++)
- Microsoft Windows
- CYGWIN (w/ g++ compiler)
- Visual C++
- Mac OSX (g++)
Source code can be obtained either by
- Downloading a snapshot of the source code for VRPH 1.0.0 from the VRPH source code download page, or
- Checking out the latest stable source using a Git client.
The recommended method is to use Git because it makes it easier to obtain updates.
Quick Start Guide for Unix-like Environments
In a Unix-like environment (such as Linux or CYGWIN), the following commands may be used to obtain and compile the current release of VRPH, and then run a quick test on a small benchmark problem instance:
git clone -b releases/1.0.0 https://github.com/coin-or/VRPH.git cd VRPH make make test
Getting More Help
To report a bug, please submit a trouble issue.
There is a VRPH user's mailing list for discussion. Please visit the mailing list home to join or view the archives.
Licensing and Authors
- Chris Groer (cgroerATgmailDOTcom)
VRPH was mostly developed while at the University of Maryland with advisor Bruce Golden.