VRPSolver

Branch-Cut-and-Price based exact solver for vehicle routing and some related problems

Installation

Benchmarking

Benchmarking exact algorithms against the solver

Benchmarking heuristic algorithms against the lower bound/optimal solution obtained by the solver

Creating new VRP variants

Creating efficient models for new vehicle routing problems

Testing cutting planes

Testing new families of (robust) cutting planes within a state-of-the-art Branch-Cut-and-Price algorithm