Author(s): A. D’Ariano & T. Albrecht
In the Netherlands the railway network is heavily used by heterogeneous train
traffic and characterised by short headway times.
That is why even small initial
delays may perturb the timetable causing consecutive delays.
In such conflict
situations, traffic controllers have the complicated task of deciding upon the
optimal train schedule in real-time.
They could be assisted by sophisticated
Optimal train running profiles can be designed that
fit better to the new train order and allow the reduction of delays and energy
consumption at the same time.
This paper presents a formulation for this complex
problem that makes it suitable for quantitative analysis and for optimizing actual
running times at network scale.
A conflict solution system is developed thatmodels
the train scheduling problem as an alternative graph.
Adopting the blocking time
model, safe headway distances between trains are assured by any real-time traffic
The optimal solution from a network point of view can be
improved by modifying the speed profiles locally for the individual train routes.
A constructive heuristic algorithm for the dynamic modification of running times
during operations is proposed that satisfies the timetable constraints of train orders
and routes and guarantees the feasibility of the running profile, while taking into
account the properties of the signalling and train protection systems in use.
example from the Netherlands in the case of the Dutch signalling system
NS54 is presented to demonstrate the benefits of the proposed methodology.
railway traffic management, train scheduling, delay minimization, train
speed optimization, energy optimal train control.
Size: 453 kb
Paper DOI: 10.2495/978-1-84564-500-7/14
the Full Article
You can purchase the full text version of this article in Adobe PDF format for the above price. Please click the 'Buy Paper' icon below to purchase this paper.
this page to a colleague.