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

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.

• Record URL:
  • https://doi.org/10.1016/j.tre.2018.01.002
• Record URL:
  • http://www.sciencedirect.com/science/article/pii/S1366554517301382
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/13665545
• Supplemental Notes:
  • Abstract reprinted with permission of Elsevier.
• Authors:
  • Wu, Xin (Bruce)
  • Nie, Lei
  • Xu, Meng
  • Yan, Fei
• Publication Date: 2018-3

Language

• English

Media Info

• Media Type: Web
• Features: Appendices; Figures; References; Tables;
• Pagination: pp 186-209
• Serial:
  • Transportation Research Part E: Logistics and Transportation Review
  • Volume: 111
  • Issue Number: 0
  • Publisher: Elsevier
  • ISSN: 1366-5545
  • Serial URL: http://www.sciencedirect.com/science/journal/13665545

Subject/Index Terms

• TRT Terms: Algorithms; Delta functions; Demand; Food; High speed rail; Perishables; Supply chain management; Uncertainty
• Uncontrolled Terms: Catering; Deadlines
• Subject Areas: Freight Transportation; Planning and Forecasting; Railroads;

Filing Info

• Accession Number: 01663366
• Record Type: Publication
• Files: TRIS
• Created Date: Mar 21 2018 10:12AM