On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization

Applying traditional integer programming techniques in order to solve real logistic problems can be an important challenge. To ensure tractability, real instances are often either simplified in scope or limited in size, given rise to solutions that may not address realistic issues. In this paper we present a novel approach to solve a multicommodity capacitated network flow problem with concave routing costs, considering also outsourcing, overload and underutilization facility costs. It is derived from a real NP production and transportation problem concerning to the processing of biological samples in a large health-care network, with consideration of volume-based price incentives—i.e. economies of scale—on the shipping costs. It is a tactical level model providing the global view of network layout and the coordinating policy among facilities with realistic assessment of long-term operations costs. The goal is to find an efficient resolution procedure in order to integrate it into a Decision Support System used by planners. With this aim, we analyse three alternative methods of linearizing the involved modified all-units discount cost function. Performance of the different modelling techniques is shown through extensive computations.

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

[2]  Björn Geißler,et al.  Using Piecewise Linear Functions for Solving MINLP s , 2012 .

[3]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[4]  Michael Poss,et al.  An improved Benders decomposition applied to a multi-layer network design problem , 2009, Oper. Res. Lett..

[5]  Jannik Matuschke,et al.  An Integrated Approach to Tactical Transportation Planning in Logistics Networks , 2016, Transp. Sci..

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

[7]  Paul A. Rubin,et al.  Combinatorial Benders Cuts for the Minimum Tollbooth Problem , 2009, Oper. Res..

[8]  Lap Mui Ann Chan,et al.  Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures , 2002, Manag. Sci..

[9]  Jose M. Framiñan,et al.  A Decision-Making Tool for a Regional Network of Clinical Laboratories , 2013, Interfaces.

[10]  Stefan Schneider,et al.  Compact bidding languages and supplier selection for markets with economics of scale and scope , 2011, Eur. J. Oper. Res..

[11]  George L. Nemhauser,et al.  A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization , 2006, Oper. Res..

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

[13]  Mustafa Batuhan Ayhan,et al.  A two stage approach for supplier selection problem in multi-item/multi-supplier environment with quantity discounts , 2015, Comput. Ind. Eng..

[14]  Michael Poss,et al.  Benders Decomposition for the Hop-Constrained Survivable Network Design Problem , 2013, INFORMS J. Comput..

[15]  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..

[16]  Amir Saman Kheirkhah,et al.  A network approach modeling of multi-echelon spare-part inventory system with backorders and quantity discount , 2015, Ann. Oper. Res..

[17]  Hui-Ming Wee,et al.  Revisiting a fuzzy rough economic order quantity model for deteriorating items considering quantity discount and prepayment , 2013, Math. Comput. Model..

[18]  Shu-Cherng Fang,et al.  A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems , 2013, INFORMS J. Comput..

[19]  H. Pirkul,et al.  New formulation and relaxation to solve a concave-cost network flow problem , 1997 .

[20]  Harihara Prasad Natarajan,et al.  Integrated Procurement Planning in Multi‐division Firms , 2014 .

[21]  A. Lim,et al.  The freight allocation problem with all-units quantity-based discount: A heuristic algorithm , 2012 .

[22]  Charles L. Munson,et al.  The appeal of partially centralised purchasing policies , 2007 .

[23]  Marianthi G. Ierapetritou,et al.  Speed-up Benders decomposition using maximum density cut (MDC) generation , 2013, Ann. Oper. Res..

[24]  Panos M. Pardalos,et al.  Minimum concave-cost network flow problems: Applications, complexity, and algorithms , 1991 .

[25]  George L. Nemhauser,et al.  Nonconvex, lower semicontinuous piecewise linear optimization , 2008, Discret. Optim..

[26]  Amy Mainville Cohn,et al.  Network design and flow problems with cross-arc costs , 2008, Eur. J. Oper. Res..

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

[28]  Hui-Ming Wee,et al.  Joint single vendor-single buyer supply chain problem with stochastic demand and fuzzy lead-time , 2013, Knowl. Based Syst..

[29]  James Hill,et al.  A heuristic for single-warehouse multiretailer supply chains with all-unit transportation cost discounts , 2008, Eur. J. Oper. Res..

[30]  Fred W. Glover,et al.  The deterministic multi-item dynamic lot size problem with joint business volume discount , 2000, Ann. Oper. Res..

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

[32]  Ana Muriel,et al.  Capacitated multicommodity network flow problems with piecewise linear concave costs , 2004 .

[33]  Seyed Taghi Akhavan Niaki,et al.  Optimizing the multi-product, multi-constraint, bi-objective newsboy problem with discount by a hybrid method of goal programming and genetic algorithm , 2009 .

[34]  Samit Soni,et al.  A Framework for Facilitating Sourcing and Allocation Decisions for Make-to-Order Items , 2004, Decis. Sci..

[35]  Han-Lin Li,et al.  Approximately global optimization for assortment problems using piecewise linearization techniques , 2002, Eur. J. Oper. Res..

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

[37]  Arshinder,et al.  Supply chain coordination: Perspectives, empirical studies and research directions , 2008 .

[38]  Luciana Hazin Alencar,et al.  A SUPPLIER SELECTION MODEL BASED ON CLASSIFYING ITS STRATEGIC IMPACT FOR A COMPANY'S BUSINESS RESULTS , 2014 .

[39]  K. Holmberg Solving the staircase cost facility location problem with decomposition and piecewise linearization , 1994 .

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

[41]  I. Grossmann,et al.  Optimal quantity discount coordination for supply chain optimization with one manufacturer and multiple suppliers under demand uncertainty , 2015 .

[42]  Jian Chen,et al.  Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts , 2013, Comput. Oper. Res..

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

[44]  James R. Luedtke,et al.  Locally ideal formulations for piecewise linear functions with indicator variables , 2013, Oper. Res. Lett..

[45]  Stephen C. Graves,et al.  A composite algorithm for a concave-cost network flow problem , 1989, Networks.

[46]  Hande Yaman,et al.  Multi-period supplier selection under price uncertainty , 2014, J. Oper. Res. Soc..