Abstract
It is necessary for railway companies to construct daily schedules of assigning rolling stocks to utilization paths. A utilization path consists of a series of trains that a particular rolling stock performs in a day. A mixed integer programming model based on Lai et al. [1] is presented and is shown that straightforward applications of the model result in too much computational time and also inappropriate assignment schedules due to end effects. We show that the model can be modified to alleviate these difficulties, and also show that the repeated applications of the optimization model in the rolling horizon allow to generate a feasible assignment schedule for a longer period of time thus indicating the feasibility of the optimization approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Lai, Y.C., Zeng, W.W., Liu, K.C., Wang, S.W.: Development of rolling stock assignment system for Taiwan high speed rail. In: Proceedings of 5th International Seminar on Railway Operations Modelling and Analysis, Copenhagen (2013)
Maroti, G., Kroon, L.F.: Maintenance routing for train units: the transition model. Transp. Sci. 39, 518–525 (2005)
Maroti, G., Kroon, L.: Maintenance routing for train units: the interchange model. Comput. Oper. Res. 34, 1121–1140 (2007)
Acknowledgments
This work was supported by JSPS Kakenhi Grant No. 26350437. The authors would like to express sincere appreciations to Professor Y.C. Lai of National Taiwan University and Mr. Satoshi Kato of Railway Technical Research Institute.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Morito, S., Takehi, Y., Imaizumi, J., Shiina, T. (2016). Optimization Models for Multi-period Railway Rolling Stock Assignment. In: Cerulli, R., Fujishige, S., Mahjoub, A. (eds) Combinatorial Optimization. ISCO 2016. Lecture Notes in Computer Science(), vol 9849. Springer, Cham. https://doi.org/10.1007/978-3-319-45587-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-45587-7_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45586-0
Online ISBN: 978-3-319-45587-7
eBook Packages: Computer ScienceComputer Science (R0)