Two-stage stochastic programming approach for the medical drug inventory routing problem under uncertainty

被引:48
作者
Nikzad, Erfaneh [1 ]
Bashiri, Mahdi [1 ]
Oliveira, Fabricio [2 ]
机构
[1] Shahed Univ, Dept Ind Engn, Tehran, Iran
[2] Aalto Univ, Sch Sci, Dept Math & Syst Anal, Syst Anal Lab, FI-00076 Aalto, Finland
关键词
Two-stage stochastic programming; Stochastic inventory routing problem; Medical drug distribution; Latin hypercube sampling method; Chance constraints; Matheuristic algorithm; LATIN HYPERCUBE; PERISHABLE PRODUCTS; CUT ALGORITHM; SUPPLY CHAIN; MODEL; DEMAND; APPROXIMATIONS; ALLOCATION; SHORTAGES;
D O I
10.1016/j.cie.2018.12.055
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Medical drug shortages are an important issue in health care, since they can significantly affect patients' health. Thus, selecting the appropriate distribution and inventory policies plays an important role in decreasing drug shortages. In this context, inventory routing models can be used to determine optimal policies in the context of medical drug distribution. However, in real-world conditions, some parameters in these models are subject to uncertainty. This paper examines the effects of uncertainty in the demand by relying on a two-stage stochastic programming approach to incorporate it into the optimization model. A two-stage model is then proposed and two different approaches based on chance constraints are used to assess the validity of the proposed model. In the first model, a scenario-based two-stage stochastic programming model without probabilistic constraint is proposed, while in the other two models, proposed for validation of the first model, probabilistic constraints are considered. A mathematical-programming based algorithm (a matheuristic) is proposed for solving the models. Moreover, the Latin hypercube sampling method is employed to generate scenarios for the scenario-based models. Numerical examples show the necessity of considering the stochastic nature of the problem and the accuracy of the proposed models and solution method.
引用
收藏
页码:358 / 370
页数:13
相关论文
共 48 条
[1]   A price-directed approach to stochastic inventory/routing [J].
Adelman, D .
OPERATIONS RESEARCH, 2004, 52 (04) :499-514
[2]   A hybrid L-shaped method to solve a bi-objective stochastic transshipment-enabled inventory routing problem [J].
Al-e-Hashem, Seyed M. J. Mirzapour ;
Rekik, Yacine ;
Hoseinhajlou, Ebrahim Mohammadi .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2019, 209 :381-398
[3]   A branch-and-cut algorithm for a vendor-managed inventory-routing problem [J].
Archetti, Claudia ;
Bertazzi, Luca ;
Laporte, Gilbert ;
Speranza, Maria Grazia .
TRANSPORTATION SCIENCE, 2007, 41 (03) :382-391
[4]   A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment [J].
Azadeh, A. ;
Elahi, S. ;
Farahani, M. Hosseinabadi ;
Nasirian, B. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 104 :124-133
[5]  
BEALE EML, 1955, J ROY STAT SOC B, V17, P173
[6]   Managing stochastic demand in an Inventory Routing Problem with transportation procurement [J].
Bertazzi, Luca ;
Bosco, Adamo ;
Lagana, Demetrio .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2015, 56 :112-121
[7]   A stochastic inventory routing problem with stock-out [J].
Bertazzi, Luca ;
Bosco, Adamo ;
Guerriero, Francesca ;
Lagana, Demetrio .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2013, 27 :89-107
[8]  
Birge JR, 2011, SPRINGER SER OPER RE, P3, DOI 10.1007/978-1-4614-0237-4
[9]   Populations of models, Experimental Designs and coverage of parameter space by Latin Hypercube and Orthogonal Sampling [J].
Burrage, Kevin ;
Burrage, Pamela ;
Donovan, Diane ;
Thompson, Bevan .
INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE, 2015, 51 :1762-1771
[10]  
Caulder Celeste R, 2015, Hosp Pharm, V50, P279, DOI 10.1310/hpj5004-279