4.7 Article

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

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2019.04.005

Keywords

Inventory routing problem; Stochastic optimization; Distributionally robust; Ambiguity set; Service level

Funding

  1. National Natural Science Foundation of China (NSFC) [71531011, 71771048, 71571134]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available