A convex optimization approach for solving the single-vehicle cyclic inventory routing problem

Computers & OR, Volume 72, Issue C, 2016, Pages 97-106.

Cited by: 13|Bibtex|Views15|Links
EI

Abstract:

This paper investigates the mathematical structure of the Single-Vehicle Cyclic Inventory Routing Problem (SV-CIRP). The SV-CIRP is an optimization problem consisting of finding a recurring distribution plan, from a single depot to a selected subset of retailers, that maximizes the collected rewards from the visited retailers while minimi...More

Code:

Data:

Your rating :
0

 

Tags
Comments