A perishable food supply chain problem considering demand uncertainty and time deadline constraints

Modeling and application to a high-speed railway catering service

Journal article (2018)

Authors

Xin Wu Beijing Jiaotong University
Lei Nie Beijing Jiaotong University
M. Xu Beijing Jiaotong University
F. Yan Transport and Planning - CEG
Research Group
Transport and Planning (CEG) (TU Delft)
Dirac delta function Euler algorithm Newsvendor model Rail catering Variational inequalities
More Info
expand_more

Published Date

01-03-2018

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Civil Engineering & Geosciences

Department

Transport and Planning

Research Group

Transport and Planning

Abstract

This paper attempts to optimize the flow patterns in a perishable food supply chain network for a high-speed rail catering service. The proposed variational inequality models describe the uncertain demand on trains using the Newsvendor model and impose time deadline constraints on paths considering flow-dependent lead time. The constraints are then reformulated based on the Dirac delta function so that they can be directly dualized. An Euler algorithm with an Augmented Lagrangian Dual algorithm is developed to solve the model. A case study using 246 trains in the Beijing-Shanghai high-speed corridor is applied to demonstrate the applicability of the method.