Abstract
Passenger railway systems are highly complex systems requiring the solution of several planning problems that can be analyzed and solved through the application of mathematical models and optimization techniques, which generally lead to an improvement in the performance of the system, and also to a reduction in the time required for solving these problems. The planning process is generally divided into several phases: Line Planning, Train Timetabling, Train Platforming, Rolling Stock Circulation and Crew Planning. In this paper, the Train-Unit Assignment Problem (TUAP), an important NP-hard problem arising in the Rolling Stock Circulation phase, is considered. In TUAP, we are given a set of timetabled trips, each with a required number of passenger seats, and a set of different train units, each having a cost and consisting of a self-contained train with an engine and a set of wagons with a given number of available seats. TUAP calls for the minimum cost assignment of the train units to the trips, possibly combining more than one train unit for a given trip, so as to fulfill the seat requests. Two Integer Linear Programming (ILP) formulations of TUAP are presented together with their relaxations. One is the Linear Programming (LP) relaxation of the model and valid inequalities are introduced for strengthening it. The other is based on the Lagrangian approach. Constructive heuristic algorithms, based on the previously considered relaxations, are proposed, and their solutions are improved by applying local search procedures. Extensive computational results on real-world instances are reported, showing the effectiveness of the proposed bounding procedures and heuristic algorithms.
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.
References
Abbink, E., van den Berg, B., 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)
Ben-Khedher, N., Kintanar, J., Queille, C., Stripling, W.: Schedule optimization at sncf: From conception to day of departure. Interfaces, 6–23 (1998)
Brucker, P., Hurink, J., Rolfes, T.: Routing of railway carriages. Journal of Global Optimization 27(2), 313–332 (2003)
Bussieck, M.R., Winter, T., Zimmermann, U.T.: Discrete optimization in public rail transport. Mathematical Programming 79(1), 415–444 (1997)
Cacchiani, V., Caprara, A., Galli, L., Kroon, L., Maróti, G., Toth, P.: Railway rolling stock planning: Robustness against large disruptions. Transportation Science 46(2), 217–232 (2012)
Cacchiani, V., Caprara, A., Maróti, G., Toth, P.: On integer polytopes with few nonzero vertices. Research Report DEIS (2009), http://www.or.deis.unibo.it/alberto/smallsupp.pdf
Cacchiani, V., Caprara, A., Toth, P.: Solving a real-world train-unit assignment problem. Mathematical Programming 124(1), 207–231 (2010)
Cacchiani, V., Caprara, A., Toth, P.: A lagrangian heuristic for a train-unit assignment problem. Discrete Applied Mathematics (2011), doi: 10.1016/j.dam.2011.10.035
Caprara, A.: Almost 20 years of combinatorial optimization for railway planning: from lagrangian relaxation to column generation. In: Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, vol. 14, pp. 1–12. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2010)
Caprara, A., Kroon, L., Monaci, M., Peeters, M., Toth, P.: Passenger railway optimization. In: Barnhart, C., Laporte, G. (eds.) Handbooks in Operations Research and Management Science, vol. 12, pp. 129–187 (2006)
Caprara, A., Kroon, L., Toth, P.: Optimization problems in passenger railway systems. Wiley Encyclopedia of Operations Research and Management Science 6, 3896–3905 (2011)
Cordeau, J.F., Desaulniers, G., Lingaya, N., Soumis, F., Desrosiers, J.: Simultaneous locomotive and car assignment at via rail canada. Transportation Research Part B: Methodological 35(8), 767–787 (2001)
Cordeau, J.F., Soumis, F., Desrosiers, J.: Simultaneous assignment of locomotives and cars to passenger trains. Operations Research 49(4), 531–548 (2001)
Cordeau, J.F., Toth, P., Vigo, D.: A survey of optimization models for train routing and scheduling. Transportation Science 32(4), 380–404 (1998)
Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constrained routing and scheduling. Handbooks in Operations Research and Management Science 8, 35–139 (1995)
Fioole, P.J., Kroon, L., Maróti, G., Schrijver, A.: A rolling stock circulation model for combining and splitting of passenger trains. European Journal of Operational Research 174(2), 1281–1297 (2006)
Huisman, D., Kroon, L.G., Lentink, R.M., Vromans, M.J.C.M.: Operations research in passenger railway transportation. Statistica Neerlandica 59(4), 467–497 (2005)
Lingaya, N., Cordeau, J.F., Desaulniers, G., Desrosiers, J., Soumis, F.: Operational car assignment at via rail canada. Transportation Research Part B: Methodological 36(9), 755–778 (2002)
Maróti, G.: Operations research models for railway rolling stock planning. PhD thesis, Eindhoven University of Technology, Eindhoven, The Netherlands (2006)
Nielsen, L.K., Kroon, L., Maróti, G.: A rolling horizon approach for disruption management of railway rolling stock. European Journal of Operational Research (2012), http://dx.doi.org/10.1016/j.ejor.2012.01.037
Peeters, M., Kroon, L.: Circulation of railway rolling stock: a branch-and-price approach. Computers & Operations Research 35(2), 538–556 (2008)
Rouillon, S., Desaulniers, G., Soumis, F.: An extended branch-and-bound method for locomotive assignment. Transportation Research Part B: Methodological 40(5), 404–423 (2006)
Schrijver, A.: Minimum circulation of railway stock. CWI Quarterly 6(3), 205–217 (1993)
Ziarati, K., Soumis, F., Desrosiers, J., Solomon, M.M.: A branch-first, cut-second approach for locomotive assignment. Management Science, 1156–1168 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cacchiani, V., Caprara, A., Toth, P. (2012). Models and Algorithms for the Train Unit Assignment Problem. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-32147-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32146-7
Online ISBN: 978-3-642-32147-4
eBook Packages: Computer ScienceComputer Science (R0)