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

Vidal, 1997, Strategic production-distribution models: a critical review with emphasis on global supply chain models, Eur. J. Oper. Res., 98, 1, 10.1016/S0377-2217(97)80080-X Mendoza, 2012, Analytical models for supplier selection and order quantity allocation, Appl. Math. Model., 36, 3826, 10.1016/j.apm.2011.11.025 Stadtler, 2007, A general quantity discount and supplier selection mixed integer programming model, Oper. Res. Spectr., 29, 723, 10.1007/s00291-006-0066-z Lee, 2013, An integrated model for lot sizing with supplier selection and quantity discounts, Appl. Math. Model., 37, 4733, 10.1016/j.apm.2012.09.056 Mostafa, 2012, Supplier selection and order allocation models in supply chain management: a review, World Appl. Sci. J., 18, 55 Aissaoui, 2007, Supplier selection and order lot sizing modeling: a review, Comput. Oper. Res., 34, 3516, 10.1016/j.cor.2006.01.016 Bassok, 1997, Analysis of supply contracts with total minimum commitment, IIE Trans, 29, 373, 10.1080/07408179708966342 Hammami, 2014, A scenario-based stochastic model for supplier selection in global context with multiple buyers, currency fluctuation uncertainties, and price discounts, Eur. J. Oper. Res., 233, 159, 10.1016/j.ejor.2013.08.020 Weber, 1991, Vendor selection criteria and methods, Eur. J. Oper. Res, 50, 2, 10.1016/0377-2217(91)90033-R De Boer, 2001, A review of methods supporting supplier selection, Eur. J. Purch. Supply Manag., 7, 75, 10.1016/S0969-7012(00)00028-9 Ho, 2010, Multi-criteria decision making approaches for supplier evaluation and selection: A literature review, Eur. J. Oper. Res., 202, 16, 10.1016/j.ejor.2009.05.009 Jain, 2009, Strategic supplier selection: some emerging issues and challenges, Int. J. Logist. Syst. Manag., 5, 61 Karimi, 2014, Supplier selection using revised multi-segment goal programming model, Int. J. Adv. Manuf. Technol, 70, 1227, 10.1007/s00170-013-5368-0 Megahed, 2018, Tactical supply chain planning under uncertainty with an application in the wind turbines industry, Comput. Oper. Res., 100, 287, 10.1016/j.cor.2017.12.015 Cárdenas-Barrón, 2012, A complement to “A comprehensive note on: an economic order quantity with imperfect quality and quantity discounts, Appl. Math. Model., 36, 6338, 10.1016/j.apm.2012.02.021 Chang, 2011, A comprehensive note on: an economic order quantity with imperfect quality and quantity discounts, Appl. Math. Model., 35, 5208, 10.1016/j.apm.2011.03.039 Lin, 2010, An economic order quantity with imperfect quality and quantity discounts, Appl. Math. Model., 34, 3158, 10.1016/j.apm.2010.02.004 Kokangul, 2009, Integrated analytical hierarch process and mathematical programming to supplier selection problem with quantity discount, Appl. Math. Model., 33, 1417, 10.1016/j.apm.2008.01.021 Gorji, 2014, Optimizing inventory decisions in a two-level supply chain with order quantity constraints, Appl. Math. Model., 38, 814, 10.1016/j.apm.2013.07.012 Benton, 1996, A classification of literature on determining the lot size under quantity discounts, Eur. J. Oper. Res., 92, 219, 10.1016/0377-2217(95)00315-0 Manerba, 2012, An exact algorithm for the capacitated total quantity discount problem, Eur. J. Oper. Res., 222, 287, 10.1016/j.ejor.2012.04.028 Goossens, 2007, Exact algorithms for procurement problems under a total quantity discount structure, Eur. J. Oper. Res, 178, 603, 10.1016/j.ejor.2006.03.010 Mansini, 2012, The supplier selection problem with quantity discounts and truckload shipping, Omega, 40, 445, 10.1016/j.omega.2011.09.001 Manerba, 2014, An effective matheuristic for the capacitated total quantity discount problem, Comput. Oper. Res., 41, 1, 10.1016/j.cor.2013.07.019 Hanson, 1990, Optimal bundle pricing, Manag. Sci., 36, 155, 10.1287/mnsc.36.2.155 Rosenthal, 1995, Vendor selection with bundling, Decis. Sci., 26, 35, 10.1111/j.1540-5915.1995.tb00836.x Sarkis, 1999, Vendor selection with bundling: a comment, Decis. Sci, 30, 265, 10.1111/j.1540-5915.1999.tb01609.x Bohner, 2017, Supplier selection under failure risk, quantity and business volume discounts, Comput. Ind. Eng, 104, 145, 10.1016/j.cie.2016.11.028 Meena, 2013, Multiple sourcing under supplier failure risk and quantity discount: a genetic algorithm approach, Transport. Res. E-Log., 50, 84, 10.1016/j.tre.2012.10.001 Salari, 2010, An ILP improvement procedure for the open vehicle routing problem, Comput. Oper. Res., 37, 2106, 10.1016/j.cor.2010.02.010 De Franceschi, 2006, A new ILP-based refinement heuristic for vehicle routing problems, Math. Program., 105, 471, 10.1007/s10107-005-0662-8 Hewitt, 2010, Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem, INFORMS J. Comput, 22, 314, 10.1287/ijoc.1090.0348 Erera, 2013, Improved load plan design through integer programming based local search, Transport. Sci, 47, 412, 10.1287/trsc.1120.0441 Papageorgiou, 2014, Approximate dynamic programming for a class of long-horizon maritime inventory routing problems, Transport. Sci., 49, 870, 10.1287/trsc.2014.0542 Savelsbergh, 2008, An optimization algorithm for the inventory routing problem with continuous moves, Comput. Oper. Res., 35, 2266, 10.1016/j.cor.2006.10.020 Archetti, 2008, An optimization-based heuristic for the split delivery vehicle routing problem, Transport. Sci., 42, 22, 10.1287/trsc.1070.0204 Schmid, 2009, A hybrid solution approach for ready-mixed concrete delivery, Transport. Sci., 43, 70, 10.1287/trsc.1080.0249 Song, 2010, A maritime inventory routing problem: Practical approach, Comput. Oper. Res. Pisinger, 2010, 399 Ahuja, 2002, A survey of very large-scale neighborhood search techniques, Discrete Appl. Math., 123, 75, 10.1016/S0166-218X(01)00338-9 Ribeiro, 2012, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Comput. Oper. Res., 39, 728, 10.1016/j.cor.2011.05.005 Ropke, 2006, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transport. Sci., 40, 455, 10.1287/trsc.1050.0135 Hemmelmayr, 2012, An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics, Comput. Oper. Res., 39, 3215, 10.1016/j.cor.2012.04.007 Prescott‐Gagnon, 2009, A branch‐and‐price‐based large neighborhood search algorithm for the vehicle routing problem with time windows, Networks, 54, 190, 10.1002/net.20332 Seeanner, 2013, Combining the principles of variable neighborhood decomposition search and the fix & optimize heuristic to solve multi-level lot-sizing and scheduling problems, Comput. Oper. Res., 40, 303, 10.1016/j.cor.2012.07.002 Mladenović, 1997, Variable neighborhood search, Comput. Oper. Res, 24, 1097, 10.1016/S0305-0548(97)00031-2 Hansen, 2001, Variable neighborhood search: Principles and applications, Eur. J. Oper. Res., 130, 449, 10.1016/S0377-2217(00)00100-4 Xiao, 2011, A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems, Eur. J. Oper. Res., 214, 223, 10.1016/j.ejor.2011.04.015 Xiao, 2011, A variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems, Comput. Ind. Eng., 60, 218, 10.1016/j.cie.2010.11.003 Xiao, 2014, A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems, Eur. J. Oper. Res., 235, 102, 10.1016/j.ejor.2013.10.025 Zhao, 2012, A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems, Electron. Notes Discrete Math., 39, 129, 10.1016/j.endm.2012.10.018 Sifaleras, 2015, Variable neighborhood search for the economic lot sizing problem with product returns and recovery, Int. J. Prod. Econ., 160, 133, 10.1016/j.ijpe.2014.10.003 Sifaleras, 2015, General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain, Electron. Notes Discrete Math., 47, 69, 10.1016/j.endm.2014.11.010 Stadtler, 2000, Improved rolling schedules for the dynamic single-level lot-sizing problem, Manag. Sci., 46, 318, 10.1287/mnsc.46.2.318.11924 Van Den Heuvel, 2005, A comparison of methods for lot-sizing in a rolling horizon environment, Oper. Res. Lett., 33, 486, 10.1016/j.orl.2004.10.001 Fisher, 2001, Ending inventory valuation in multi-period production scheduling, Manag. Sci., 47, 679, 10.1287/mnsc.47.5.679.10485 Kall, 1994 Birge, 2011 IBM ILOG CPLEX, User's Manual for CPLEX, 2016. Gurobi Optimization, Gurobi Optimizer Reference Manual, 2012. Croxton, 2003, A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems, Manag. Sci., 49, 1268, 10.1287/mnsc.49.9.1268.16570 Croxton, 2007, Variable disaggregation in network flow problems with piecewise linear costs, Oper. Res., 55, 146, 10.1287/opre.1060.0314 Vielma, 2010, Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions, Oper. Res, 58, 303, 10.1287/opre.1090.0721 Vielma, 2011, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Math. Program., 128, 49, 10.1007/s10107-009-0295-4