Comparing sequential and integrated approaches for the production routing problem

Abstract We consider the Production Routing Problem where production planning, inventory management and distribution planning decisions must be taken. We compare two sequential approaches, one in which production decisions are optimized first and one in which distribution decisions are optimized first, with an integrated approach where all decisions are simultaneously optimized. Some properties of the solutions obtained with the different approaches are shown. Computational experiments are performed on instances of different size which are generated using two critical parameters. The numerical results illustrate the properties and show that the benefits of the integrated approach over the two sequential ones depend on the trade-off between production and distribution costs and on the trade-off between setup and inventory costs in production.

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

[2]  Jean-François Cordeau,et al.  Benders Decomposition for Production Routing Under Demand Uncertainty , 2012, Oper. Res..

[3]  Kin Keung Lai,et al.  Integration of Inventory and Transportation Decisions in a Logistics System , 2010 .

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

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

[6]  Jean-François Cordeau,et al.  The production routing problem: A review of formulations and solution algorithms , 2015, Comput. Oper. Res..

[7]  Luca Bertazzi,et al.  Analysis of the maximum level policy in a production-distribution system , 2011, Comput. Oper. Res..

[8]  Jonathan F. Bard,et al.  Heuristics for a multiperiod inventory routing problem with production decisions , 2009, Comput. Ind. Eng..

[9]  Christian Prins,et al.  A reactive GRASP and path relinking for a combined production-distribution problem , 2007, Comput. Oper. Res..

[10]  Stéphane Dauzère-Pérès,et al.  Single item lot sizing problems , 2006, Eur. J. Oper. Res..

[11]  Maria Grazia Speranza,et al.  A Matheuristic for the Multivehicle Inventory Routing Problem , 2017, INFORMS J. Comput..

[12]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[13]  Christian Prins,et al.  A memetic algorithm with dynamic population management for an integrated production-distribution problem , 2009, Eur. J. Oper. Res..

[14]  Vinícius Amaral Armentano,et al.  Tabu search with path relinking for an integrated production-distribution problem , 2011, Comput. Oper. Res..

[15]  Francesca Fumero,et al.  Synchronized Development of Production, Inventory, and Distribution Schedules , 1999, Transp. Sci..

[16]  Jonathan F. Bard,et al.  The integrated production–inventory–distribution–routing problem , 2009, J. Sched..

[17]  Jonathan F. Bard,et al.  A branch-and-price algorithm for an integrated production and inventory routing problem , 2010, Comput. Oper. Res..

[18]  Luca Bertazzi,et al.  A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem , 2007, Transp. Sci..

[19]  Jean-François Cordeau,et al.  Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem , 2011, Transp. Sci..

[20]  Stéphane Dauzère-Pérès,et al.  A Two-Phase Iterative Heuristic Approach for the Production Routing Problem , 2015, Transp. Sci..

[21]  Marshall L. Fisher,et al.  Coordination of production and distribution planning , 1994 .