Skip to content

Composed a paper about analyzing matheuristic algorithms for multi-depot inventory routing problem. Divided customers into groups and assigned a depot to each group by solving an integer linear problem using PULP library in Python. Generated the routes from depots to individual customers by implementing Dijkstra’s algorithm using Python.

Notifications You must be signed in to change notification settings

cedricni/Routing-Problem-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

About

Composed a paper about analyzing matheuristic algorithms for multi-depot inventory routing problem. Divided customers into groups and assigned a depot to each group by solving an integer linear problem using PULP library in Python. Generated the routes from depots to individual customers by implementing Dijkstra’s algorithm using Python.

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published