With Heuristiclab 3.3.7, a new version of the vehicle routing plugin has been released. It includes several variants of this rich problem class that often occurs in practical applications dealing with transportation. The new plugin version 3.4 supports several variants and also provides standard benchmark instances known from the literature.
The supported variants are:
- Capacitated Vehicle Routing Problem (CVRP)
- Distance constrained CVRP (DCVRP)
- CVRP with time windows (CVRPTW)
- Multi-depot CVRP (MDCVRP)
- MDCVRP with time windows (MDCVRPTW)
- Pickup and delivery problem with time windows (PDPTW)
The architecture of the plugin is flexible so it can incorporate new variants which is planned in the future. Currently our work focuses on dynamic and stochastic VRPs. We will keep you posted on that and will release an addon for HeuristicLab soon that adds support for dynamic vehicle routing.
It is very easy to experiment with the different benchmark instances, since two standard algorithms are included, namely a genetic algorithm and also a tabu search. These algorithms work on all the included variants.
Download HeuristicLab 3.3.7 (http://dev.heuristiclab.com/trac/hl/core/wiki/Download) and give it a try!
Joseph Helm finished a very nice implementation of the job shop scheduling problem (JSSP) earlier this year. The add-on is available as zip-archive from our daily build download page. Just extract the .dll-files in the zip-archive into your HeuristicLab installation directory and you are ready to create and optimize JSSP instances.