Skip to Main content Skip to Navigation
Journal articles

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

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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02132335
Contributor : Accord Elsevier CCSD Connect in order to contact the contributor
Submitted on : Friday, October 22, 2021 - 8:41:19 PM
Last modification on : Saturday, January 15, 2022 - 3:57:34 AM
Long-term archiving on: : Monday, January 24, 2022 - 5:07:42 PM

File

S1366554518305088.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License

Identifiers

Citation

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, Elsevier, 2019, 126, pp.190--211. ⟨10.1016/j.tre.2019.04.005⟩. ⟨hal-02132335⟩

Share

Metrics

Record views

50

Files downloads

29