Abstract

In the fixed-block railway traffic, the trains adjust their speeds in view of their preceding allowable spaces caused by their respective front adjacent trains or specified by scheduling commands. The railway lines have the line-type speed limits within some block sections and the point-type ones at the terminals of block sections. Those speed limits originate from line conditions, scheduling commands and indications of signal equipment. This paper attempts to in detail reveal the train movement mechanism synthetically considering those temporal–spatial constraints. The proposed train movement model defines four kinds of target points and utilizes them to successively engender the instantaneous target points with their corresponding target speeds. It adopts the rule-based description mechanism in cellular automata (CA) but with continuous spaces to replicate restrictive, autonomous and synergistic behaviors of and among trains. The selections of accelerations and decelerations are based upon the data models of practical acceleration and deceleration processes; thereupon, the model is data-driven. The analysis of train movement dynamics through case studies demonstrates that the extended CA model can reproduce the train movement mechanism of grading speed control to satisfy the aforementioned temporal–spatial constraints. The model is applicable to represent the as-is or should-be states of train movements when adjustable parameters are properly configured.

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.