Citation

Wu X, Nie L, Xu M, Zhao L. Transp. Res. E Logist. Transp. Rev. 2019; 123: 61-89.

Copyright

(Copyright © 2019, Elsevier Publishing)

DOI

10.1016/j.tre.2019.01.003

PMID

unavailable

Abstract

A non-linear mixed integer programming problem is developed to establish a distribution plan for catering services of high-speed railways (CSHRs) based on lot-sizing networks. The model attempts to determine the locations for producing different types of food products and controlling the inventory levels of trains during their trips, considering the storage capacities and time-varying demands. A Lagrangian substitution-based solution approach is applied to decompose the model into a mixed integer linear programming model and a sequence of univariate concave models. Computational experiments indicate that the approach performs satisfactorily in terms of computational time and solution quality in a real-world situation.

Language: en

Keywords

Catering service; Decomposition algorithm; In-station congestion; Lot-sizing; Time-varying demand