Dantzig-Wolfe decomposition for the facility location and production planning problem

Abstract There are several mathematical models proposed for the facility location and production planning problem in the literature. However, some of these models disregard what products each customer has ordered and neglect critical production-related constraints and setup decisions while some others do not well define the connection cost between customers and facilities. In this study, we propose two mathematical models to overcome the disadvantages aforementioned, along with their reformulations by item decomposition to improve lower bounds. We demonstrate that the pricing subproblems of the item decomposition are related to uncapacitated lot-sizing problems with the Wagner-Whitin property. This property is employed to enhance the performance of column generation for the item decomposition. Our computational results show that this item decomposition method can improve lower bounds over other classical lower bounding techniques, such as linear programming relaxation and model reformulation. Additionally, we implement the proposed item decomposition method to other benchmark problems in the literature and observe that our proposed method can improve the benchmark solutions with a statistical significance.

[1]  Laurence A. Wolsey,et al.  On the Wagner-Whitin Lot-Sizing Polyhedron , 2001, Math. Oper. Res..

[2]  James R. Evans An efficient implementation of the Wagner-Whitin algorithm for dynamic lot-sizing , 1985 .

[3]  Alan S. Manne,et al.  Programming of Economic Lot Sizes , 1958 .

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

[5]  Simon Görtz,et al.  A branch-and-price algorithm for the capacitated facility location problem , 2007, Eur. J. Oper. Res..

[6]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[7]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[8]  Andreas Drexl,et al.  Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation , 2005, Manag. Sci..

[9]  M. Rao,et al.  An Algorithm for the M-Median Plant Location Problem , 1974 .

[10]  Yanxia Zhang,et al.  Integrated optimization of location, inventory and routing in supply chain network design , 2019, Transportation Research Part B: Methodological.

[11]  Tao Wu,et al.  Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem , 2017, INFORMS J. Comput..

[12]  Zeger Degraeve,et al.  Improved lower bounds for the capacitated lot sizing problem with setup times , 2004, Oper. Res. Lett..

[13]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[14]  Leyuan Shi,et al.  An HNP-MP Approach for the Capacitated Multi-Item Lot Sizing Problem With Setup Times , 2010, IEEE Transactions on Automation Science and Engineering.

[15]  Bert De Reyck,et al.  Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times , 2015, INFORMS J. Comput..

[16]  Gilbert Laporte,et al.  Benders Decomposition for Large-Scale Uncapacitated Hub Location , 2011, Oper. Res..

[17]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.

[18]  Joseph Geunes,et al.  Exact algorithms for integrated facility location and production planning problems , 2011 .

[19]  Martin W. P. Savelsbergh,et al.  A generic view of Dantzig-Wolfe decomposition in mixed integer programming , 2006, Oper. Res. Lett..

[20]  Tao Wu,et al.  Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems , 2010, INFORMS J. Comput..

[21]  José M. Valério de Carvalho,et al.  Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem , 2010, Optim. Methods Softw..

[22]  Zeger Degraeve,et al.  BIBLIOGRAPHIC DATA AND CLASSIFICATIONS , 2003 .

[23]  Silvio A. de Araujo,et al.  Hybrid methods for lot sizing on parallel machines , 2015, Comput. Oper. Res..

[24]  Yinyu Ye,et al.  A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem , 2005, Math. Oper. Res..

[25]  Bert De Reyck,et al.  A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times , 2016, INFORMS J. Comput..

[26]  Zuo-Jun Max Shen,et al.  Stochastic Transportation-Inventory Network Design Problem , 2005, Oper. Res..

[27]  Canrong Zhang,et al.  Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines , 2018, INFORMS J. Comput..

[28]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[29]  Dolores Romero Morales,et al.  A probabilistic analysis of the multi-period single-sourcing problem , 2001, Discret. Appl. Math..

[30]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[31]  Hasan Pirkul,et al.  Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System , 1996, Transp. Sci..

[32]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[33]  B. P. Dzielinski,et al.  Optimal Programming of Lot Sizes, Inventory and Labor Allocations , 1965 .

[34]  Canrong Zhang,et al.  Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials , 2019, Eur. J. Oper. Res..

[35]  K. Hindi Computationally efficient solution of the multi-item, capacitated lot-sizing problem , 1995 .

[36]  Fan Xiao,et al.  The green capacitated multi-item lot sizing problem with parallel machines , 2018, Comput. Oper. Res..

[37]  Zuo-Jun Max Shen,et al.  A Joint Location - Inventory Model , 2003, Transp. Sci..

[38]  Zuo-Jun Max Shen,et al.  Integrating facility location and production planning decisions , 2010 .

[39]  Francisco Barahona,et al.  Plant location with minimum inventory , 1998, Math. Program..

[40]  John O. McClain,et al.  Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction , 1983 .

[41]  Albert P. M. Wagelmans,et al.  A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem , 1999, Oper. Res..

[42]  Jean-François Cordeau,et al.  Solving a large multi-product production-routing problem with delivery time windows , 2019, Omega.