Abstract: About this book
This state-of-the-art survey features papers that were selected after an open call following the International Dagstuhl Seminar on Algorithmic Methods for Railway Optimization held in Dagstuhl Castle, Germany, in June 2004. The second part of the volume constitutes the refereed proceedings of the 4th International Workshop on Algorithmic Methods and Models for Optimization of Railways held in Bergen, Norway, in September 2004.
The volume covers algorithmic methods for analyzing and solving problems arising in railway optimizations, with a special focus on the interplay between railway and other public transportation systems. Beside algorithmics and mathematical optimization, the relevance of formal models and the influence of applications on problemmodeling are also considered. In addition, the papers address experimental studies and useful prototype implementations.
The 17 full papers presented here were carefully reviewed and selected from numerous submissions and are organized into topical sections covering network and line planning, timetabling and timetable information, rolling stock and crew scheduling, and real-time operations.
Abstract: We conduct an experimental study for the timetablingproblem in a public railway network
under disruptions. We investigate three bicriteria optimi
zation problems introduced recently
that model the robustness of a timetable towards delays. We e
xperimentally evaluated these
models against various waiting time rules at stations. Our r
esults constitute the first proofs-
of-concept for these new robust timetabling approaches.
Abstract: We conduct an experimental study for a fundamental case of the timetablingproblem in a public railway network under disruptions. Three bicriteria optimazation problems, modeling the robustness of the timetable towards delays, are experimentally evaluated against various waiting time rules at stations. Our results constitute the first proofs-of-concept for these models.
Abstract: We conduct an experimental study for the timetablingproblem in a public railway network under disruptions. We investigate three bicriteria optimization problems introduced recently that model the robustness of a timetable towards delays. We experimentally evaluated these models against various waiting time rules at stations. Our results constitute the rst proofs-of-concept for these new robust timetabling approaches.