Fill-rate service level constrained distribution network design

被引:6
作者
Escalona, Pablo [1 ]
Angulo, Alejandro [2 ]
Brotcorne, Luce [3 ]
Fortz, Bernard [3 ,4 ,5 ]
Tapia, Paulina [1 ]
机构
[1] Univ Tecn Federico Santa Maria, Dept Ind Engn, Ave Espana 1680, Valparaiso, Chile
[2] Univ Tecn Federico Santa Maria, Dept Elect Engn, Ave Espana 1680, Valparaiso, Chile
[3] INRIA Lille Nord Europe, INOCS Team, 40 Ave Halley, F-59650 Villeneuve DAscq, France
[4] Univ Liege, HEC Management Sch, B-4000 Liege, Belgium
[5] Univ Libre Bruxelles, Fac Sci, Dept Informat, Blvd Triomphe Bruxelles, B-1050 Brussels, Belgium
关键词
location; inventory; fill rate; network design; conic integer programming; outer approximation; INVENTORY-LOCATION PROBLEM; SUPPLY CHAIN DESIGN; BENDERS DECOMPOSITION; ALGORITHM; MODEL; BRANCH;
D O I
10.1111/itor.13331
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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)$(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.
引用
收藏
页码:5 / 28
页数:24
相关论文
共 59 条
[1]   A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems [J].
Atamtuerk, Alper ;
Berenguer, Gemma ;
Shen, Zuo-Jun .
OPERATIONS RESEARCH, 2012, 60 (02) :366-381
[2]  
Axsater S., 2015, INVENTORY CONTROL, V225
[3]   A simple procedure for determining order quantities under a fill rate constraint and normally distributed lead-time demand [J].
Axsater, Sven .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (01) :480-491
[4]   Fill rate: from its definition to its calculation for the continuous (s, Q) inventory system with discrete demands and lost sales [J].
Babiloni, Eugenia ;
Guijarro, Ester .
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2020, 28 (01) :35-43
[5]  
Bala M, 2011, J TRANSP SUPPLY CHAI, V5, P23
[6]   Alternative regularizations for Outer-Approximation algorithms for convex MINLP [J].
Bernal, David E. ;
Peng, Zedong ;
Kronqvist, Jan ;
Grossmann, Ignacio E. .
JOURNAL OF GLOBAL OPTIMIZATION, 2022, 84 (04) :807-842
[7]   Periodic review inventory systems with a service level criterion [J].
Bijvank, Marco .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2014, 65 (12) :1853-1863
[8]  
Boyd Stephen, 2004, Convex Optimization
[9]   Benefits of considering inventory in service parts logistics network design problems with time-based service constraints [J].
Candas, Mehmet Ferhat ;
Kutanoglu, Erhan .
IIE TRANSACTIONS, 2007, 39 (02) :159-176
[10]   Outer approximation with conic certificates for mixed-integer convex problems [J].
Coey, Chris ;
Lubin, Miles ;
Vielma, Juan Pablo .
MATHEMATICAL PROGRAMMING COMPUTATION, 2020, 12 (02) :249-293