×

Fill-rate service level constrained distribution network design. (English) Zbl 07772040

Summary: The design of distribution networks that simultaneously consider location and inventory decisions seeks to balance costs and product availability. The most commonly observed measure of product availability in practical settings is the fill-rate service level. However, the optimal design of a distribution network that considers the fill rate to control shortages of fast-moving consumer goods (FMCG) is considered intractable and has only been addressed by heuristic methods. This paper addresses the optimal design of a distribution network for FMCG able to provide high fill-rate service level under a continuous review \((r,Q)\) policy. Considering the exact formulation for the provided fill rate, we formulated a joint location-inventory model with fill-rate service level constraints as a convex mixed integer nonlinear problem for which a novel decomposition-based outer approximation algorithm is proposed. Numerical experiments have shown that our solution approach provides good-quality solutions that are on average 0.15% and, at worst, 2.2% from the optimal solution.
© 2023 The Authors. International Transactions in Operational Research © 2023 International Federation of Operational Research Societies.

MSC:

90-XX Operations research, mathematical programming
Full Text: DOI

References:

[1] Atamtürk, A., Berenguer, G., Shen, Z.J., 2012. A conic integer programming approach to stochastic joint location‐inventory problems. Operations Research60, 2, 366-381. · Zbl 1248.90057
[2] Axsäter, S., 2006. A simple procedure for determining order quantities under a fill rate constraint and normally distributed lead‐time demand. European Journal of Operational Research174, 1, 480-491. · Zbl 1104.90005
[3] Axsäter, S., 2015. Inventory Control, International Series in Operations Research & Management Science, Vol. 225. Springer, Berlin. · Zbl 1351.90003
[4] Babiloni, E., Guijarro, E., 2020. Fill rate: from its definition to its calculation for the continuous (s, q) inventory system with discrete demands and lost sales. Central European Journal of Operations Research28, 1, 35-43. · Zbl 07176678
[5] Bala, M., Kumar, D., 2011. Supply chain performance attributes for the fast moving consumer goods industry. Journal of Transport and Supply Chain Management5, 1, 23-38.
[6] Bernal, D.E., Peng, Z., Kronqvist, J., Grossmann, I.E., 2022. Alternative regularizations for outer‐approximation algorithms for convex MINLP. Journal of Global Optimization84, 4, 807-842. · Zbl 1505.90082
[7] Bijvank, M., 2014. Periodic review inventory systems with a service level criterion. Journal of the Operational Research Society65, 12, 1853-1863.
[8] Boyd, S., Vandenberghe, L., 2004. Convex Optimization. Cambridge University Press, New York. · Zbl 1058.90049
[9] Candas, M.F., Kutanoglu, E., 2007. Benefits of considering inventory in service parts logistics network design problems with time‐based service constraints. IIE Transactions39, 2, 159-176.
[10] Coey, C., Lubin, M., Vielma, J.P., 2020. Outer approximation with conic certificates for mixed‐integer convex problems. Mathematical Programming Computation12, 2, 249-293. · Zbl 1441.90095
[11] Craig, N., DeHoratius, N., Raman, A., 2016. The impact of supplier inventory service level on retailer demand. Manufacturing & Service Operations Management18, 4, 461-474.
[12] Dakin, R.J., 1965. A tree‐search algorithm for mixed integer programming problems. The Computer Journal8, 3, 250-255. · Zbl 0154.42004
[13] Darmawan, A., Wong, H., Thorstenson, A., 2021. Supply chain network design with coordinated inventory control. Transportation Research Part E: Logistics and Transportation Review145, 102168.
[14] Daskin, M., Coullard, C., Shen, Z., 2002. An inventory‐location model: formulation, solution algorithm and computational results. Annals of Operations Research110, 83-106. · Zbl 1013.90001
[15] Daskin, M.S., 2011. Network and Discrete Location: Models, Algorithms, and Applications. John Wiley & Sons, Hoboken, NJ.
[16] De Mauri, M., Gillis, J., Swevers, J., Pipeleers, G., 2020. A proximal‐point outer approximation algorithm. Computational Optimization and Applications77, 755-777. · Zbl 1466.90055
[17] Diabat, A., Abdallah, T., Henschel, A., 2015. A closed‐loop location‐inventory problem with spare parts consideration. Computers & Operations Research54, 245-256. · Zbl 1348.90081
[18] Duran, M.A., Grossmann, I.E., 1986. An outer‐approximation algorithm for a class of mixed‐integer nonlinear programs. Mathematical Programming36, 3, 307-339. · Zbl 0619.90052
[19] Eppen, G., 1979. Effect of centralization on expected cost in a multi‐location newsboy problem. Management Science25, 498-501. · Zbl 0419.90049
[20] Escalona, P., Araya, D., Simpson, E., Ramirez, M., Stegmaier, R., 2021. On the shortage control in a continuous review \((Q, r)\) inventory policy using \(\alpha_L\) service level. RAIRO‐Operations Research55, 5, 2785-2806. · Zbl 1475.90006
[21] Escalona, P., Marianov, V., Ordóñez, F., Stegmaier, R., 2018. On the effect of inventory policies on distribution network design with several demand classes. Transportation Research Part E: Logistics and Transportation Review111, 229-240.
[22] Escalona, P., Ordóñez, F., Marianov, V., 2015. Joint location‐inventory problem with differentiated service levels using critical level policy. Transportation Research Part E: Logistics and Transportation Review83, 141-157.
[23] Floudas, C.A., 1995. Nonlinear and Mixed‐Integer Optimization: Fundamentals and Applications. Oxford University Press, New York. · Zbl 0886.90106
[24] Geoffrion, A.M., 1972. Generalized benders decomposition. Journal of Optimization Theory and Applications10, 4, 237-260. · Zbl 0229.90024
[25] Jeet, V., Kutanoglu, E., Partani, A., 2009. Logistics network design with inventory stocking for low‐demand parts: modeling and optimization. IIE Transactions41, 5, 389-407.
[26] Johnston, F., Boylan, J.E., Shale, E.A., 2003. An examination of the size of orders from customers, their characterization and the implications for inventory control of slow moving items. Journal of the Operational Research Society54, 8, 833-837. · Zbl 1095.90506
[27] Khan, S.A.R., Yu, Z., 2019. Strategic Supply Chain Management, Springer, Berlin.
[28] Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E., 2019. A review and comparison of solvers for convex MINLP. Optimization and Engineering20, 397-455.
[29] Kronqvist, J., Lundell, A., Westerlund, T., 2016. The extended supporting hyperplane algorithm for convex mixed‐integer nonlinear programming. Journal of Global Optimization64, 249-272. · Zbl 1339.90247
[30] Leyffer, S., 2001. Integrating SQP and branch‐and‐bound for mixed integer nonlinear programming. Computational Optimization and Applications18, 295-309. · Zbl 1009.90074
[31] Miranda, P.A., Garrido, R.A., 2008. Valid inequalities for Lagrangian relaxation in an inventory location problem with stochastic capacity. Transportation Research Part E: Logistics and Transportation Review44, 1, 47-65.
[32] Miranda, P.A., Garrido, R.A., 2006. A simultaneous inventory control and facility location model with stochastic capacity constraints. Networks and Spatial Economics6, 1, 39-53. · Zbl 1106.90010
[33] Miranda, P., Garrido, R., 2004. Incorporating inventory control decision into a strategic distribution network design model with stochastic demand. Transportation Research Part E40, 183-207.
[34] Muckstadt, J.A., 2005. Background Concepts: An Introduction to the (s‐1, s) Policy under Poisson and Compound Poisson Demand. Springer New York, New York, pp. 37-67.
[35] Muts, P., Nowak, I., Hendrix, E.M., 2020. The decomposition‐based outer approximation algorithm for convex mixed‐integer nonlinear programming. Journal of Global Optimization77, 75-96. · Zbl 1441.90100
[36] Ozsen, L., Coullard, C., Daskin, M., 2008. Capacitated warehouse location model with risk pooling. Naval Research Logistics55, 295-312. · Zbl 1153.90484
[37] Park, C., 2015. Influencing factors for sustainable design implementation in the front‐end of new product development process within the fast‐moving‐consumer‐goods sector. PhD thesis, Centre for Competitive Creative Design, School of Applied Science, Cranfield University, Bedford, UK.
[38] Perez Loaiza, R.E., Olivares‐Benitez, E., Miranda Gonzalez, P.A., Guerrero Campanur, A., Martinez Flores, J.L., 2017. Supply chain network design with efficiency, location, and inventory policy using a multiobjective evolutionary algorithm. International Transactions in Operational Research24, 1‐2, 251-275. · Zbl 1358.90127
[39] Peterson, R., Silver, E.A., 1979. Decision Systems for Inventory Management and Production Planning, Wiley, New York.
[40] Quesada, I., Grossmann, I.E., 1992. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Computers & Chemical Engineering16, 10‐11, 937-947.
[41] Ramaekers, K., Janssens, G.K., 2008. On the choice of a demand distribution for inventory management models. European Journal of Industrial Engineering2, 4, 479-491.
[42] Schneider, H., 1981. Effect of service‐levels on order‐points or order‐levels in inventory models. The International Journal of Production Research19, 6, 615-631.
[43] Shahabi, M., Unnikrishnan, A., Jafari‐Shirazi, E., Boyles, S.D., 2014. A three level location‐inventory problem with correlated demand. Transportation Research Part B: Methodological69, 1-18.
[44] Shen, Z.J.M., 2005. A multi‐commodity supply chain design problem. IIE Transactions37, 753-762.
[45] Shen, Z., Coullard, C., Daskin, M., 2003. A joint location‐inventory model. Transportation Science37, 40-55.
[46] Sherbrooke, C.C., 2006. Optimal Inventory Modeling of Systems: Multi‐Echelon Techniques, International Series in Operations Research & Management Science, Vol. 72. Springer Science & Business Media, Berlin. · Zbl 1140.90017
[47] Shu, J., Teo, C.P., Shen, Z.J.M., 2005. Stochastic transportation‐inventory network design problem. Operations Research53, 1, 48-60. · Zbl 1165.90367
[48] Silver, E.A., Pyke, D.F., Peterson, R., 1998. Inventory Management and Production Planning and Scheduling, Vol. 3. Wiley New York.
[49] Snyder, L., Daskin, M., Teo, C.P., 2007. The stochastic location model with risk pooling. European Journal of Operational Research179, 1221-1238. · Zbl 1127.90039
[50] Su, L., Tang, L., Bernal, D.E., Grossmann, I.E., 2018. Improved quadratic cuts for convex mixed‐integer nonlinear programs. Computers & Chemical Engineering109, 77-95.
[51] Su, L., Tang, L., Grossmann, I.E., 2015. Computational strategies for improved MINLP algorithms. Computers & Chemical Engineering75, 40-48.
[52] Tan, Y., Paul, A.A., Deng, Q., Wei, L., 2017. Mitigating inventory overstocking: optimal order‐up‐to level to achieve a target fill rate over a finite horizon. Production and Operations Management26, 11, 1971-1988.
[53] Tapia‐Ubeda, F.J., Miranda, P.A., Macchi, M., 2018. A generalized benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints. European Journal of Operational Research267, 3, 806-817. · Zbl 1403.90490
[54] Teunter, R.H., Syntetos, A.A., Babai, M.Z., 2017. Stock keeping unit fill rate specification. European Journal of Operational Research259, 3, 917-925. · Zbl 1402.90011
[55] Webster, M., Beach, R., Fouweather, I., 2006. E‐business strategy development: an FMCG sector case study. Supply Chain Management: An International Journal11, 4, 353-362.
[56] Westerlund, T., Pettersson, F., 1995. An extended cutting plane method for solving convex MINLP problems. Computers & Chemical Engineering19, 131-136.
[57] Wheatley, D., Gzara, F., Jewkes, E., 2015. Logic‐based benders decomposition for an inventory‐location problem with service constraints. Omega55, 10-23.
[58] You, F., Grossmann, I., 2008. Mixed‐integer nonlinear programming models and algorithms for large‐scale supply chain design with stochastic inventory management. Industrial & Engineering Chemistry Research47, 7802-7817.
[59] Zipkin, P., 1986. Inventory service‐level measures: convexity and approximation. Management Science32, 8, 975-981. · Zbl 0593.90019
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.