In this paper we solve a practical Multi-Depot Inventory Routing Problem (MDIRP). One minimizes routing costs by determining how to serve the customers from different depots, managing their inventory levels to avoid stock-outs. The MDIRP optimizes the trade-off between inventory and routing decisions in an integrated way. We formulate this problem as a mixed-integer linear programming model and design a three-phase matheuristic to solve the problem. The solutions of our matheuristic are compared with those from a branch-and-cut algorithm on classical IRP instances, new instances and a real case study, showing to be very effective.
A matheuristic algorithm for the multi-depot inventory routing problem
De Maio A.
;Lagana D.
2019-01-01
Abstract
In this paper we solve a practical Multi-Depot Inventory Routing Problem (MDIRP). One minimizes routing costs by determining how to serve the customers from different depots, managing their inventory levels to avoid stock-outs. The MDIRP optimizes the trade-off between inventory and routing decisions in an integrated way. We formulate this problem as a mixed-integer linear programming model and design a three-phase matheuristic to solve the problem. The solutions of our matheuristic are compared with those from a branch-and-cut algorithm on classical IRP instances, new instances and a real case study, showing to be very effective.| File | Dimensione | Formato | |
|---|---|---|---|
|
A Matheuristic Algorithm for the Multi Depot Inventory Routing Problem_submitted_version.pdf
accesso aperto
Descrizione: The published article is available at https://www.sciencedirect.com/science/article/abs/pii/S1366554518307749; DOI: 10.1016/j.tre.2019.01.005
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
274.12 kB
Formato
Adobe PDF
|
274.12 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
