Algorithms and models for railway optimization

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mobility is increasing in a way that calls for systematic traffic planning in a broad context. In Europe the railways are requested to play a central role in this development. Future developments and improvements of European railways will have an impact on people's lives and therefore on society in general. The problems arising in this context are large and highly complex. Here are many interesting and challenging algorithmic problems waiting to be studied. Research topics include the network design, line planning, time table generation, crew scheduling, rolling stock rostering, shunting, time table information and delay management. In this talk we present models and algorithmic methods for several of these problems. We will discuss the interplay between algorithmic aspects and practical issues like availability and quality of data. The focus will be on two topics from network design and time table information respectively where we have ongoing cooperation with railway companies. As an example from network design, we will consider a scenario, where the effects of introducing new train stops in the existing railway network is studied. For time table information whose algorithmic core problem is the computation of shortest paths we discuss new algorithmic issues arising from the huge size of the underlying data. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Wagner, D. (2003). Algorithms and models for railway optimization. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2748, 198–206. https://doi.org/10.1007/978-3-540-45078-8_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free