Skip to content

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.

Notifications You must be signed in to change notification settings

ZhouC-J/Capacitated-Vehicle-Routing

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 

About

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.

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 100.0%