nishkaks / Capacitated-Vehicle-Routing

In this project we focus on the set covering based formulation for the capacitated vehicle routing problem (CVRP). A column generation approach based on dynamic programming has been used to find a lower bound to the optimal solution.
15Updated 9 years ago

Related projects

Alternatives and complementary repositories for Capacitated-Vehicle-Routing