A computational study for the inventory routing problem

Cited by: 0|Views2

Abstract:

In this work we compare several new computational approaches to an inventory routing problem, in which a single product is shipped from a warehouse to retailers via an uncapacitated vehicle. We survey exact algorithms for the Traveling Salesman Problem (TSP) and its relaxations in the literature for the routing component. For the invent...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments