Branch-and-price + Resource Constrained Shortest Path Pricing


VRPSolver is a Branch-Cut-and-Price based exact solver for vehicle routing and some related problems.

Main use cases of the solver are: - benchmarking heuristic algorithms against the lower bound/optimal solution obtained by the solver; - benchmarking exact algorithms against the solver; - creating efficient models for new vehicle routing problems; - testing new families of (robust) cutting planes within a state-of-the-art Branch-Cut-and-Price algorithm.

Status. Available for academics.