For real world railroad networks, it is considered minimizing operational cost of tram schedules which depend on choosing different tram types of diverse speed and cost. It is developed a mixed integer linear programming model for this tram scheduling problem. For practical problem sizes, it seems to be impossible to directly solve the model within a reasonable amount of time. The suitable decomposition leads to much better performance. In the first part of the decomposition, only the train type related constraints stay active. In the second part, using an optimal solution of this relaxation, it is selected and fixed train types and it is tried to generate a tram schedule satisfying the remaining constraints. This decomposition idea provides the cornerstone for an algorithm integrating cutting planes and branch-and-bound. Computational results for railroad networks from Germany and the Netherlands are presented.
Cost optimal periodic train scheduling
Mathematical Methods of Operations Research ; 62 , 2 ; 281-295
2005
15 Seiten, 6 Bilder, 4 Tabellen, 14 Quellen
Article (Journal)
English
Optimal train scheduling in presence of track circuits
British Library Conference Proceedings | 1994
|OPTIMAL TRAIN STOPPING SCHEDULING FOR HIGH SPEED RAIL SYSTEMS
British Library Conference Proceedings | 1999
|A Constraint-Based Scheduling Model for Optimal Train Dispatching
British Library Conference Proceedings | 2010
|TRAIN SCHEDULING MANAGEMENT DEVICE AND TRAIN SCHEDULING MANAGEMENT METHOD
European Patent Office | 2020
|A topological model based on railway capacity to manage periodic train scheduling
Tema Archive | 2005
|