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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transportation Research Part E: Logistics and Transportation Review
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
