Abstract
Experts working for railway operators still have to devote much time and effort to creating plans for rolling stock allocation. In this paper, we formulate the railway rolling stock allocation problem as a set partitioning multi-commodity flow (SPMCF) problem and we propose a search-based heuristic approach for SPMCF. We show that our approach can obtain an approximate solution near the optimum in shorter time than CPLEX for real-life problems. Since our approach deals with a wide variety of constraint expressions, it would be applicable for developing practical plans automatically for many railway operators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abbink, E., Berg, V.D., Kroon, L., Salomon, M.: Allocation of Railway Rolling Stock for Passenger Trains. Transportation Science 38(1), 33–41 (2004)
Alfieri, A., Groot, R., Kroon, L., Schrijver, A.: Efficient circulation of railway rolling stock. Transportation Science 40(3), 378–391 (2006)
Cordeau, J., Toth, P., Vigo, D.: A Survey of Optimization Models for Train Routing and Scheduling. Transportation Science 32(4), 380–404 (1998)
Cordeau, J., Soumis, F., Desrosiers, J.: A Benders Decomposition Appoach for the Locomotive and Car Assignment Problem. Transportation Science 34(2), 133–149 (2000)
Erlebach, T., et al.: On the Complexity of Train Assignment Problems. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 390–402. Springer, Heidelberg (2001)
Krishna, C., et al.: New Approaches for Solving the Block-to-train Assignment Problem. Networks 51(1), 48–62 (2007)
Lettovsky, L., Johnson, E.L., Nemhauser, G.L.: Airline crew recovery. Transportation Science 34(4), 337–348 (2000)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice Hall, Englewood Cliffs (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otsuki, T., Aisu, H., Tanaka, T. (2010). A Search-Based Approach to the Railway Rolling Stock Allocation Problem. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-17461-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17460-5
Online ISBN: 978-3-642-17461-2
eBook Packages: Computer ScienceComputer Science (R0)