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 条
[21]   Joint location-inventory problem with differentiated service levels using critical level policy [J].
Escalona, P. ;
Ordonez, F. ;
Marianov, V. .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2015, 83 :141-157
[22]   On the shortage control in a continuous review (Q, r) inventory policy using αL service-level [J].
Escalona, Pablo ;
Araya, Diego ;
Simpson, Enrique ;
Ramirez, Mario ;
Stegmaier, Raul .
RAIRO-OPERATIONS RESEARCH, 2021, 55 (05) :2785-2806
[23]  
Floudas C. A., 1995, Topics in Chemical Engineering)
[24]  
Geoffrion A. M., 1972, Journal of Optimization Theory and Applications, V10, P237, DOI 10.1007/BF00934810
[25]   Logistics network design with inventory stocking for low-demand parts: Modeling and optimization [J].
Jeet, Vishv ;
Kutanoglu, Erhan ;
Partani, Amit .
IIE TRANSACTIONS, 2009, 41 (05) :389-407
[26]   An examination of the size of orders from customers, their characterisation and the implications for inventory control of slow moving items [J].
Johnston, FR ;
Boylan, JE ;
Shale, EA .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (08) :833-837
[27]  
Khan SAR, 2019, EAI SPRINGER INNOVAT, P1, DOI 10.1007/978-3-030-15058-7
[28]   A review and comparison of solvers for convex MINLP [J].
Kronqvist, Jan ;
Bernal, David E. ;
Lundell, Andreas ;
Grossmann, Ignacio E. .
OPTIMIZATION AND ENGINEERING, 2019, 20 (02) :397-455
[29]   The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming [J].
Kronqvist, Jan ;
Lundell, Andreas ;
Westerlund, Tapio .
JOURNAL OF GLOBAL OPTIMIZATION, 2016, 64 (02) :249-272
[30]   Integrating SQP and branch-and-bound for mixed integer nonlinear programming [J].
Leyffer, S .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2001, 18 (03) :295-309