Lars Wittrup Jensen
Assessment of robust capacity utilisation in railway networks
The capacity of a railway system cannot easily be defined as it depends not only on the infrastructure, but also on operational constraints and the speed, acceleration and deceleration of the rolling stock used. As a consequence the capacity of a railway system cannot be assessed with traditional methods without a timetable. In this presentation our work on a railway capacity model will be presented together with case results. The model deals with some of the deficiencies in traditional methods. The proposed model is able to estimate the capacity consumption for a railway system only given a set of trains. A timetable is thus not needed as an input. Furthermore, the capacity model is coupled with a stochastic simulation to account for robustness in the capacity assessment.
Simon Henry Bull
Line Planning in Practice
Line planning is selecting the routes, stops, and frequencies of the lines to operate in a train network. A good plan for the average passenger may look very different from a good plan from the operator perspective; in fact a line plan with minimal operating cost may provide a very poor passenger service, while a plan that best serves the passenger may be costly or difficult to operate. In this project we have investigated how completely new line plans may be constructed for the DSB S-tog network to best serve the passenger, while still considering operational costs and restrictions.
Jørgen Thorlund Haahr
Integrated disruption planning
In order to achieve a more robust railway operation, it is necessary to develop integrated solutions for planning and disruption handling, covering time scheduling, rolling stock assignment, maintenance and crew.
Integrated planning avoids further cancellations due to lack of resources and makes it possible to react faster. Examples and results from DSB S-tog are presented.
Jens Parbo Jensen
Improving Passenger-Oriented Line Planning Algorithm
The objective of the current study is to optimise the line configuration of a railway system so that passengers are accommodated in a way that minimises their number of transfers as well as their waiting time experienced at boarding and transfers stations, respectively. To do this, an improving algorithm is developed to solve the line planning problem with explicit consideration of passengers’ travel behaviour. The developed algorithm is bi-level, where optimising the railway line configuration and deriving the passengers’ adapted travel behaviour are done sequentially. Due to the inherent complexity of the line planning problem with explicit consideration of passengers’ travel behaviour, a heuristic solution approach is developed. The bi-level algorithm is validated on the suburban railway network operating in the Greater Copenhagen area in Denmark. Applying the improving bi-level passenger-oriented line planning algorithm to this network reveals a reduction of 3.83 % in railway passengers’ number of transfers and 3.88 % in their waiting time.
Aleksander Sniady
Communication solutions for the future ERTMS
In modern railways, communication-based services are becoming increasingly important. In the future, this process is expected to continue. Therefore, communication networks will be essential elements of many vital railway systems, such as: train control, scheduling, operations, maintenance and passenger information. This presentation discusses research on communication solutions that are likely to become part of the future ERTMS—after year 2020.
Linh Hong Vu
Automated, Formal Verification of Safety Requirements for Interlocking Systems
In this talk, we present a holistic method for efficient development and verification of railway interlocking systems: a mathematically rigorous, yet easy-to-use method. It offers an automated and complete verification of safety requirements, allowing errors in interlocking designs to be discovered in early phases of the development cycle. The method has successfully been applied to the early deployment line in the Danish Signalling Programme.