TY - JOUR
T1 - DISTRIBUTIONALLY ROBUST FRONT DISTRIBUTION CENTER INVENTORY OPTIMIZATION WITH UNCERTAIN MULTI-ITEM ORDERS
AU - Zhang, Yuli
AU - Han, Lin
AU - Zhuang, Xiaotian
N1 - Publisher Copyright:
© 2022 American Institute of Mathematical Sciences. All rights reserved.
PY - 2022/6
Y1 - 2022/6
N2 - As a new retail model, the front distribution center (FDC) has been recognized as an effective instrument for timely order delivery. However, the high customer demand uncertainty, multi-item order pattern, and limited inventory capacity pose a challenging task for FDC managers to determine the optimal inventory level. To this end, this paper proposes a two-stage distributionally robust (DR) FDC inventory model and an efficient row-and-column generation (RCG) algorithm. The proposed DR model uses a Wasserstein distance-based distributional set to describe the uncertain demand and utilizes a robust conditional value at risk decision criterion to mitigate the risk of distribution ambiguity. The proposed RCG is able to solve the complex max-min-max DR model exactly by repeatedly solving relaxed master problems and feasibility subproblems. We show that the optimal solution of the non-convex feasibility subproblem can be obtained by solving two linear programming problems. Numerical experiments based on real-world data highlight the superior out-of-sample performance of the proposed DR model in comparison with an existing benchmark approach and validate the computational efficiency of the proposed algorithm.
AB - As a new retail model, the front distribution center (FDC) has been recognized as an effective instrument for timely order delivery. However, the high customer demand uncertainty, multi-item order pattern, and limited inventory capacity pose a challenging task for FDC managers to determine the optimal inventory level. To this end, this paper proposes a two-stage distributionally robust (DR) FDC inventory model and an efficient row-and-column generation (RCG) algorithm. The proposed DR model uses a Wasserstein distance-based distributional set to describe the uncertain demand and utilizes a robust conditional value at risk decision criterion to mitigate the risk of distribution ambiguity. The proposed RCG is able to solve the complex max-min-max DR model exactly by repeatedly solving relaxed master problems and feasibility subproblems. We show that the optimal solution of the non-convex feasibility subproblem can be obtained by solving two linear programming problems. Numerical experiments based on real-world data highlight the superior out-of-sample performance of the proposed DR model in comparison with an existing benchmark approach and validate the computational efficiency of the proposed algorithm.
KW - Distibutionally robust
KW - conditional value at risk
KW - front distribution center
KW - inventory optimization
KW - row-and-column generation
UR - http://www.scopus.com/inward/record.url?scp=85131180462&partnerID=8YFLogxK
U2 - 10.3934/dcdss.2022006
DO - 10.3934/dcdss.2022006
M3 - Article
AN - SCOPUS:85131180462
SN - 1937-1632
VL - 15
SP - 1777
EP - 1795
JO - Discrete and Continuous Dynamical Systems - Series S
JF - Discrete and Continuous Dynamical Systems - Series S
IS - 6
ER -