Optimizing the moment of customer delivery in ORTEC Inventory Routing

Inventory Routing is a Vendor Managed Inventory solution that minimizes the long-term costs involved in distributing a product to multiple customers, while preventing stock-outs at those customers. In this thesis we aim to identify opportunities to improve the selection criteria used by OIR to decide on a day by day basis which customers to deliver to. Currently this decision is integrated in the construction of the routes by using the daily cost per volume as a short-term objective to minimize the total cost per volume over the horizon. First, we design two short-term solution approaches that aim to minimize the daily cost per volume without constructing the delivery routes. We find that the daily cost per volume is not always a good indicator of the total cost per volume, but that a method incorporating a capacitated minimum spanning tree nevertheless shows promising results. Second, we design alternative short-term objectives and examine their effect on the long-term objective. In doing so we find that optimizing the cost per volume of each delivery to a customer gives better results than optimizing the cost per volume of each day or each route.

[1]  L. R. Esau,et al.  On Teleprocessing System Design Part II: A Method for Approximating the Optimal Network , 1966, IBM Syst. J..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

[4]  Bruce L. Golden,et al.  Analysis of a large scale vehicle routing problem with an inventory component , 1984 .

[5]  Moshe Dror,et al.  A computational comparison of algorithms for the inventory routing problem , 1985 .

[6]  Moshe Dror,et al.  A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities , 1998, Transp. Sci..

[7]  Moshe Dror,et al.  Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework , 2002, Transp. Sci..

[8]  Uri Zwick,et al.  Algorithms -- ESA 2003 : 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003 : proceedings , 2003 .

[9]  Martin W. P. Savelsbergh,et al.  A Decomposition Approach for the Inventory-Routing Problem , 2004, Transp. Sci..

[10]  Frank Mathew FOR THE CAPACITATED MINIMUM SPANNING TREE PROBLEM , 2006 .

[11]  Martin W. P. Savelsbergh,et al.  Performance Measurement for Inventory Routing , 2007, Transp. Sci..

[12]  Marielle Christiansen,et al.  Industrial aspects and literature survey: Combined inventory management and routing , 2010, Comput. Oper. Res..

[13]  Thierry Benoist,et al.  Randomized Local Search for Real-Life Inventory Routing , 2011, Transp. Sci..

[14]  Leandro C. Coelho,et al.  The exact solution of several classes of inventory-routing problems , 2013, Comput. Oper. Res..

[15]  T. Veenstra Door de bomen het bos weer zien , 2013, Tijdschrift voor praktijkondersteuning.

[16]  Gilbert Laporte,et al.  Thirty Years of Inventory Routing , 2014, Transp. Sci..

[17]  Goos Kant,et al.  An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing , 2014 .

[18]  Yossiri Adulyasak,et al.  Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems , 2012, INFORMS J. Comput..

[19]  Eishi Chiba,et al.  A heuristic algorithm for the prize collecting Steiner Tree problem , 2014, 2014 IEEE International Conference on Industrial Engineering and Engineering Management.

[20]  J. Ritter,et al.  Vehicle Routing Problems with Pro ts , 2015 .

[21]  Demetrio Laganà,et al.  A decomposition-based heuristic for the multiple-product inventory-routing problem , 2015, Comput. Oper. Res..

[22]  Lei Sun,et al.  Transportation cost allocation on a fixed route , 2015, Comput. Ind. Eng..

[23]  Nicoleta Neagu,et al.  An incremental approach using local-search heuristic for inventory routing problem in industrial gases , 2015, Comput. Chem. Eng..

[24]  G. Kant,et al.  Determining Which Orders to Outsource in the Vehicle Routing Problem with Order Outsourcing , 2015 .

[25]  Maria Grazia Speranza,et al.  The inventory routing problem: the value of integration , 2016, Int. Trans. Oper. Res..

[26]  Nicos Christofides Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.