Abstract
A distinctive feature of the train control process is that it is fairly easy to handle when trains are running according to their timetables and no disturbances occur, but is extremely difficult to handle in an optimal way in case of disruptions. Within this research area, one focus has been on development of models, algorithms and systems, which support optimal computer-aided train dispatching. This paper summarises an evaluation of the properties, in general and with respect to rules and conditions in Sweden, of one of the more important of the existing algorithms. We have also implemented it as a minor prototype system in order to, off-line, evaluate its possibilities and limitations concerning the dynamic aspects of train traffic control.
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 callDisclaimer: 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.
