Distributionally robust inventory routing problem to maximize the service level under limited budget - Archive ouverte HAL Access content directly
Journal Articles Transportation Research Part E: Logistics and Transportation Review Year : 2019

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

Ming Liu
Xin Liu
Chengbin Chu

Abstract

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.
Fichier principal
Vignette du fichier
S1366554518305088.pdf (826.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02132335 , version 1 (22-10-2021)

Licence

Attribution - NonCommercial

Identifiers

Cite

Ming Liu, Xin Liu, Feng Chu, Feifeng Zheng, Chengbin Chu. Distributionally robust inventory routing problem to maximize the service level under limited budget. Transportation Research Part E: Logistics and Transportation Review, 2019, 126, pp.190--211. ⟨10.1016/j.tre.2019.04.005⟩. ⟨hal-02132335⟩
72 View
54 Download

Altmetric

Share

Gmail Facebook X LinkedIn More