Abstract
Determining cost-effective vehicle scheduling is an important optimization issue in mass transportation networks. An interesting question in this context is whether allowing certain flexibility in the departure times of scheduled routes may reduce the number of vehicles needed. We formulate this question as the Flexible Train Rostering problem. We consider two cases that are of practical interest:
-
Unlimited flexibility: only the durations of routes are given and we are free to determine the most appropriate departure time for each route.
-
Limited flexibility: initial departure times are given, together with a delay threshold ε; we are asked to determine the most appropriate delay ≤ ε for each route.
We also consider variants where we are allowed to use empty rides, (i.e., routes without passengers). We present a variety of results for these problems: polynomial-time algorithms that optimally solve some of them, \(\mathcal{NP}\)- and \(\mathcal{APX}\)-hardness proofs for others, as well as approximation algorithms for most of the hard problems.
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
Anderegg, L., Eidenbenz, S., Gantenbein, M., Stamm, C., Taylor, D.S., Weber, B., Widmayer, P.: Train Routing Algorithms: Concepts, Design Choices, and Practical Considerations. In: Proceedings of The Fifth Workshop on Algorithm Engineering and Experiments (ALENEX 2003), pp. 106–118 (2003)
Bertossi, A., Carraresi, P., Gallo, G.: On some matching problems arising in vehicle scheduling models. Networks 17, 271–281 (1987)
Brucker, P., Hurink, J.L., Rolfes, T.: Routing of railway carriages: a case study. Memorandum No. 1498, University of Twente, Fac. of Mathematical Sciences (1999)
Carpaneto, G., Dell’Amico, M., Fischetti, M., Toth, P.: A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19, 531–548 (1989)
Dantzig, G., Fulkerson, D.: Minimizing the number of tankers to meet a fixed schedule. Nav. Res. Logistics Q. 1, 217–222 (1954)
Erlebach, T., Gantenbein, M., Hürlimann, D., Neyer, G., Pagourtzis, A., Penna, P., Schlude, K., Steinhöfel, K., Taylor, D.S., Widmayer, P.: On the Complexity of Train Assignment Problems. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 390–402. Springer, Heidelberg (2001)
Freling, R., Paixão, J.M.P., Wagelmans, A.P.M.: Models and algorithms for vehicle scheduling. Report 9562/A, Econometric Institute, Erasmus University Rotterdam (1999)
Hochbaum, D.S.: Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 94–143. PWS Publishing Company (1996)
Hochbaum, D.S.: Approximation Algorithms for the Set Covering and Vertex Cover Problems. SIAM J. Comput. 11(3), 555–556 (1982)
Löbel, A.: Optimal vehicle scheduling in public transit. PhD thesis, TU Berlin (1998)
Ribeiro, C., Soumis, F.: A column generation approach to the multiple-depot vehicle scheduling problem. Operations Research 42(1), 41–52 (1991)
Schrijver, A.: Minimum circulation in railway stock. CWI Quarterly 6(3), 205–217 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eidenbenz, S., Pagourtzis, A., Widmayer, P. (2003). Flexible Train Rostering. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive