A collection of solutions to variations of the vehicle routing problem.
Currently, there are implementations of the petal heuristics method (PetalHeuristics.py) and a method developed during my work at the UNT Computational Epidemiology Lab, dubbed the RSS Algorithm (OVRP-UT.py).
I am working on implementing the Branch and Bound method.
More information on the Vehicle Routing Problem: http://neo.lcc.uma.es/vrp/vehicle-routing-problem/ Methods of solving the VRP: http://neo.lcc.uma.es/vrp/solution-methods/