A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts

Abstract Supplier selection with quantity discounts has been an active research problem in the literature. In this paper, we focus on a new real-world quantity discounts scheme, where suppliers are selected in the beginning of a strategic planning period (e.g., 5 years). Monthly orders are placed from the selected suppliers, but the quantity discounts are based on the aggregated annual order quantities. We incorporate this type of cost structure in a multi-period, multi-product, multi-echelon supply chain planning problem, and develop a mixed integer linear programming (MIP) model for it. Our model is highly intractable; leading commercial solvers cannot construct high quality feasible solutions for realistic instances even after multiple hours of solution time. We develop an algorithm that constructs an initial feasible solution and a large neighborhood search method that combines two customized iterative algorithms based on MIP-based local search and improves such solution. We report numerical results for a food supply chain application and show the efficiency of using our methodology in getting very high quality primal solutions quickly.

[1]  Albert P. M. Wagelmans,et al.  A comparison of methods for lot-sizing in a rolling horizon environment , 2005, Oper. Res. Lett..

[2]  Najla Aissaoui,et al.  Supplier selection and order lot sizing modeling: A review , 2007, Comput. Oper. Res..

[3]  Ravi Anupindi,et al.  Analysis of supply contracts with total minimum commitment , 1997 .

[4]  Dries R. Goossens,et al.  Exact algorithms for procurement problems under a total quantity discount structure , 2007, Eur. J. Oper. Res..

[5]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[6]  Martin W. P. Savelsbergh,et al.  Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem , 2010, INFORMS J. Comput..

[7]  Marc Goetschalckx,et al.  Tactical supply chain planning under uncertainty with an application in the wind turbines industry , 2017, Comput. Oper. Res..

[8]  M. Setak,et al.  Supplier Selection and Order Allocation Models in Supply Chain Management: A Review , 2012 .

[9]  Martin W. P. Savelsbergh,et al.  Improved Load Plan Design Through Integer Programming Based Local Search , 2013, Transp. Sci..

[10]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[11]  Tien-Yu Lin,et al.  An economic order quantity with imperfect quality and quantity discounts , 2010 .

[12]  Thomas L. Magnanti,et al.  Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs , 2007, Oper. Res..

[13]  Matteo Fischetti,et al.  A new ILP-based refinement heuristic for Vehicle Routing Problems , 2006, Math. Program..

[14]  Cecilia Temponi,et al.  A scenario-based stochastic model for supplier selection in global context with multiple buyers, currency fluctuation uncertainties, and price discounts , 2014, Eur. J. Oper. Res..

[15]  Herbert Meyr,et al.  Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems , 2013, Comput. Oper. Res..

[16]  Chao Xie,et al.  A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems , 2012, Electron. Notes Discret. Math..

[17]  Leopoldo Eduardo Cárdenas-Barrón.  A complement to “A comprehensive note on: An economic order quantity with imperfect quality and quantity discounts” , 2012 .

[18]  W. C. Benton,et al.  Vendor selection criteria and methods , 1991 .

[19]  Edward C. Rosenthal,et al.  Vendor Selection with Bundling , 1995 .

[20]  Hossein Karimi,et al.  Optimizing inventory decisions in a two-level supply chain with order quantity constraints , 2014 .

[21]  Daniele Manerba,et al.  An effective matheuristic for the capacitated total quantity discount problem , 2014, Comput. Oper. Res..

[22]  W. C. Benton,et al.  A classification of literature on determining the lot size under quantity discounts , 1996 .

[23]  S. Deshmukh,et al.  Strategic supplier selection: some emerging issues and challenges , 2009 .

[24]  George L. Nemhauser,et al.  Modeling disjunctive constraints with a logarithmic number of binary variables and constraints , 2011, Math. Program..

[25]  Stefan Minner,et al.  Supplier selection under failure risk, quantity and business volume discounts , 2017, Comput. Ind. Eng..

[26]  Ali Kokangül,et al.  Integrated analytical hierarch process and mathematical programming to supplier selection problem with quantity discount , 2009 .

[27]  Yuchun Xu,et al.  A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems , 2014, Eur. J. Oper. Res..

[28]  Angelo Sifaleras,et al.  General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain , 2015, Electron. Notes Discret. Math..

[29]  Ikou Kaku,et al.  A variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems , 2011, Comput. Ind. Eng..

[30]  Marc Goetschalckx,et al.  Strategic production-distribution models: A critical review with emphasis on global supply chain models , 1997 .

[31]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[32]  J Figueira,et al.  Stochastic Programming , 1998, J. Oper. Res. Soc..

[33]  Thomas L. Magnanti,et al.  A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems , 2003, Manag. Sci..

[34]  M. Savelsbergh,et al.  The supplier selection problem with quantity discounts and truckload shipping , 2012 .

[35]  Hung-Chi Chang.  A comprehensive note on: An economic order quantity with imperfect quality and quantity discounts , 2011 .

[36]  Xiaowei Xu,et al.  Multi-criteria decision making approaches for supplier evaluation and selection: A literature review , 2010, Eur. J. Oper. Res..

[37]  George L. Nemhauser,et al.  Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions , 2010, Oper. Res..

[38]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009 .

[39]  Amy H. I. Lee,et al.  An integrated model for lot sizing with supplier selection and quantity discounts , 2013 .

[40]  Ward Hanson,et al.  Optimal bundle pricing , 1990 .

[41]  Sarada Prasad Sarmah,et al.  Multiple sourcing under supplier failure risk and quantity discount: A genetic algorithm approach , 2013 .

[42]  Abraham Mendoza,et al.  Analytical models for supplier selection and order quantity allocation , 2012 .

[43]  Marshall L. Fisher,et al.  Ending Inventory Valuation in Multiperiod Production Scheduling , 2001, Manag. Sci..

[44]  Martin W. P. Savelsbergh,et al.  An optimization algorithm for the inventory routing problem with continuous moves , 2008, Comput. Oper. Res..

[45]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[46]  L. D. Boer,et al.  A review of methods supporting supplier selection , 2001 .

[47]  Martin W. P. Savelsbergh,et al.  A Hybrid Solution Approach for Ready-Mixed Concrete Delivery , 2009, Transp. Sci..

[48]  Ikou Kaku,et al.  A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems , 2011, Eur. J. Oper. Res..

[49]  Kevin C. Furman,et al.  A maritime inventory routing problem: Practical approach , 2013, Comput. Oper. Res..

[50]  N. Mladenović,et al.  Variable neighborhood search for the economic lot sizing problem with product returns and recovery , 2015 .

[51]  Hartmut Stadtler.  A general quantity discount and supplier selection mixed integer programming model , 2007, OR Spectr..

[52]  Hossein Karimi,et al.  Supplier selection using revised multi-segment goal programming model , 2014 .

[53]  Paolo Toth,et al.  An ILP improvement procedure for the Open Vehicle Routing Problem , 2008, Comput. Oper. Res..

[54]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

[55]  Hartmut Stadtler,et al.  Improved rolling schedules for the dynamic single level lot sizing problem , 2000 .

[56]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[57]  Dimitri J. Papageorgiou,et al.  Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems , 2015, Transp. Sci..

[58]  Martin W. P. Savelsbergh,et al.  An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem , 2008, Transp. Sci..

[59]  Joseph Sarkis,et al.  Vendor Selection with Bundling: A Comment* , 1999 .

[60]  Daniele Manerba,et al.  An exact algorithm for the Capacitated Total Quantity Discount Problem , 2012, Eur. J. Oper. Res..

[61]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.