Comparative analysis of algorithms and models for train running simulation

Abstract In order to find an algorithm applicable for train running time simulation in timetabling and real-time control applications (conflict detection and resolution, driver advisory system), three state-of-the-art algorithms for running time computation are compared concerning calculation imprecisions and computation times which are the main requirements in those computations. Therefore the exact solution of the differential equation of movement of the infinitesimal calculus is compared with those of the numeric approximations by E uler ’s method and G auss quadrature. A case study on German real-world tracks using three modern train configurations is performed. Additionally, the influences of mass modelling as mass strap or mass point and the possibility to emulate the mass strap behaviour by using a pre-computed slope profile is examined. Furthermore the influence of the detailedness of slope profiles on computation times and accuracy is analysed and a method which can be used for reducing the grade of detailedness of pre-computed slope profiles is shown. It is illustrated that high precision computations can only be carried out, when it is acceptable to use more computation time. In this context, the results reveal that this conflict of objectives can be solved by using a correctly parameterised E uler ’s method, which can be used for all applications under examination as it offers a good trade-off between calculation time and preciseness.

[1]  Thomas Schank,et al.  A Fast Algorithm for Computing the Running-Time of Trains by Infinitesimal Calculus , 2011 .

[2]  Phil Howlett,et al.  Energy-efficient train control , 1994 .

[3]  Andrea D'Ariano,et al.  Conflict Resolution and Train Speed Coordination for Solving Real-Time Timetable Perturbations , 2007, IEEE Transactions on Intelligent Transportation Systems.

[4]  Felix Schmid,et al.  A review of methods to measure and calculate train resistances , 2000 .

[5]  A. Stephan.  Openpowernet - the new co-simulation tool for traction power supply , 2010 .

[6]  Marco Lüthi,et al.  Improving the efficiency of heavily used railway networks through integrated real-time rescheduling , 2009 .

[7]  Francesco Corman,et al.  Effectiveness of dynamic reordering and rerouting of trains in a complicated and densely occupied station area , 2011 .

[8]  Peter Spellucci,et al.  Numerische Mathematik für Ingenieure und Physiker , 1979 .

[9]  Blair F. Thompson,et al.  Bisected Direct Quadratic Regula Falsi , 2010 .

[10]  Thomas Albrecht,et al.  The Influence of Anticipating Train Driving on the Dispatching Process in Railway Conflict Situations , 2009 .

[11]  Dietrich Wende.  Fahrdynamik des Schienenverkehrs , 2003 .

[12]  Joaquin Rodriguez,et al.  A constraint programming model for real-time train scheduling at junctions , 2007 .

[13]  Johanna Törnquist,et al.  Computer-based decision support for railway traffic scheduling and dispatching: A review of models and algorithms , 2005, ATMOS.