liuxiang2020 / capacitated-vehicle-routing Goto Github PK
View Code? Open in Web Editor NEWThis project forked from 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.