Skip to content

adity/Vehicle-Routing

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This project focuses 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 
the lower bound for the optimal solution.

The following libraries need to be installed for the code to run
 NumPy
 Matplotlib
 Networkx
 Gurobi(Commmercial MIP solver)




For detailed analysis, please refer to 
The Vehicle Routing Problem

By
Toth & Vigo

About

Column generation

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published