A perishable food supply chain problem considering demand uncertainty and time deadline constraints: Modeling and application to a high-speed railway catering service

Xin Wu; Lei Nie; Meng Xu; Fei Yan

doi:10.1016/j.tre.2018.01.002

A perishable food supply chain problem considering demand uncertainty and time deadline constraints: Modeling and application to a high-speed railway catering service

Xin Wu, Lei Nie^*, Meng Xu, Fei Yan

^*Corresponding author for this work

Transport and Planning

Research output: Contribution to journal › Article › Scientific › peer-review

28 Citations (Scopus)

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.

Original language	English
Pages (from-to)	186-209
Number of pages	24
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	111
DOIs	https://doi.org/10.1016/j.tre.2018.01.002
Publication status	Published - 1 Mar 2018

Keywords

Dirac delta function
Euler algorithm
Newsvendor model
Rail catering
Variational inequalities

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.tre.2018.01.002

Cite this

@article{7349afbd433244bf8e81e4ce079a926c,

title = "A perishable food supply chain problem considering demand uncertainty and time deadline constraints: Modeling and application to a high-speed railway catering service",

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.",

keywords = "Dirac delta function, Euler algorithm, Newsvendor model, Rail catering, Variational inequalities",

author = "Xin Wu and Lei Nie and Meng Xu and Fei Yan",

year = "2018",

month = mar,

day = "1",

doi = "10.1016/j.tre.2018.01.002",

language = "English",

volume = "111",

pages = "186--209",

journal = "Transportation Research. Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier",

}

A perishable food supply chain problem considering demand uncertainty and time deadline constraints : Modeling and application to a high-speed railway catering service. / Wu, Xin; Nie, Lei; Xu, Meng; Yan, Fei.

In: Transportation Research Part E: Logistics and Transportation Review, Vol. 111, 01.03.2018, p. 186-209.

Research output: Contribution to journal › Article › Scientific › peer-review

TY - JOUR

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

T2 - Modeling and application to a high-speed railway catering service

AU - Wu, Xin

AU - Nie, Lei

AU - Xu, Meng

AU - Yan, Fei

PY - 2018/3/1

Y1 - 2018/3/1

N2 - 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.

AB - 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.

KW - Dirac delta function

KW - Euler algorithm

KW - Newsvendor model

KW - Rail catering

KW - Variational inequalities

UR - http://www.scopus.com/inward/record.url?scp=85044729589&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2018.01.002

DO - 10.1016/j.tre.2018.01.002

M3 - Article

AN - SCOPUS:85044729589

VL - 111

SP - 186

EP - 209

JO - Transportation Research. Part E: Logistics and Transportation Review

JF - Transportation Research. Part E: Logistics and Transportation Review

SN - 1366-5545

ER -

A perishable food supply chain problem considering demand uncertainty and time deadline constraints: Modeling and application to a high-speed railway catering service

Abstract

Keywords

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this