Photo from wikipedia
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… Click to show full 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.
Journal Title: Transportation Research Part E: Logistics and Transportation Review
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!