Distributionally robust inventory routing problem to maximize the service level under limited budget

被引:19
作者
Liu, Ming [1 ]
Liu, Xin [1 ]
Chu, Feng [2 ,3 ]
Zheng, Feifeng [4 ]
Chu, Chengbin [5 ]
机构
[1] Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China
[2] Fuzhou Univ, Sch Econ & Management, Fujian 350108, Peoples R China
[3] Univ Paris Saclay, Univ Evry, IBISC, F-91025 Evry, France
[4] Donghua Univ, Glorious Sun Sch Business & Management, Shanghai, Peoples R China
[5] Univ Paris Est, ESIEE Paris, Syst Engn Dept, Paris, France
基金
中国国家自然科学基金;
关键词
Inventory routing problem; Stochastic optimization; Distributionally robust; Ambiguity set; Service level; FACILITY LOCATION PROBLEM; STACKELBERG GAME; OPTIMIZATION; ALGORITHM; DEMAND; MODEL; UNCERTAINTY; PORTFOLIO; POLICIES; NETWORK;
D O I
10.1016/j.tre.2019.04.005
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper studies a stochastic inventory routing problem with alternative handling modules and limited capital budget, under partial distributional information (i.e., the mean and covariance matrix of customer demands). The objective is to maximize the service level, i.e., the probability of jointly ensuring no stockout and respecting the warehouse capacities for all customers at the end of each period. A novel distributionally robust chance constrained formulation is proposed. The sample average approximation method and a model-based hierarchical approach based on problem analysis are developed. Computational results show that the latter approach is more efficient. We also draw some managerial insights.
引用
收藏
页码:190 / 211
页数:22
相关论文
共 59 条
[1]   Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems [J].
Adulyasak, Yossiri ;
Cordeau, Jean-Francois ;
Jans, Raf .
INFORMS JOURNAL ON COMPUTING, 2014, 26 (01) :103-120
[2]   Modeling inventory routing problems in supply chains of high consumption products [J].
Aghezzaf, EH ;
Raa, B ;
Van Landeghem, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 169 (03) :1048-1063
[3]   An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem [J].
Agra, Agostinho ;
Requejo, Cristina ;
Rodrigues, Filipe .
NETWORKS, 2018, 72 (01) :5-24
[4]   A branch-and-price algorithm for an integrated production and inventory routing problem [J].
Bard, Jonathan F. ;
Nananukul, Narameth .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (12) :2202-2217
[5]   IMPROVING THE DISTRIBUTION OF INDUSTRIAL GASES WITH AN ONLINE COMPUTERIZED ROUTING AND SCHEDULING OPTIMIZER [J].
BELL, WJ ;
DALBERTO, LM ;
FISHER, ML ;
GREENFIELD, AJ ;
JAIKUMAR, R ;
KEDIA, P ;
MACK, RG ;
PRUTZMAN, PJ .
INTERFACES, 1983, 13 (06) :4-23
[6]   Robust Solutions of Optimization Problems Affected by Uncertain Probabilities [J].
Ben-Tal, Aharon ;
den Hertog, Dick ;
De Waegenaere, Anja ;
Melenberg, Bertrand ;
Rennen, Gijs .
MANAGEMENT SCIENCE, 2013, 59 (02) :341-357
[7]   Deterministic order-up-to level policies in an inventory routing problem [J].
Bertazzi, L ;
Paletta, G ;
Speranza, MG .
TRANSPORTATION SCIENCE, 2002, 36 (01) :119-132
[8]   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
[9]   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
[10]   Robust sample average approximation [J].
Bertsimas, Dimitris ;
Gupta, Vishal ;
Kallus, Nathan .
MATHEMATICAL PROGRAMMING, 2018, 171 (1-2) :217-282