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 Euler’s method and Gauss 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 Euler’s method, which can be used for all applications under examination as it offers a good trade-off between calculation time and preciseness.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.