Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Method and Algorithm of Spatial-Temporal Graph Formation for Dynamic Transportation System

Version 1 : Received: 13 December 2023 / Approved: 14 December 2023 / Online: 14 December 2023 (05:58:44 CET)

How to cite: Rakhmangulov, A.; Mishkurov, P. Method and Algorithm of Spatial-Temporal Graph Formation for Dynamic Transportation System. Preprints 2023, 2023121055. https://doi.org/10.20944/preprints202312.1055.v1 Rakhmangulov, A.; Mishkurov, P. Method and Algorithm of Spatial-Temporal Graph Formation for Dynamic Transportation System. Preprints 2023, 2023121055. https://doi.org/10.20944/preprints202312.1055.v1

Abstract

The real-time Railway Traffic Management Problem (rtRTMP) is discussed in the field of railway transportation. In this paper, rtRTMP is considered for planning shunting routes based on the use of routing methods on a spatial-temporal graph. An approach and algorithm of Spatial-Temporal Graph formation for rail yard transportation network is proposed. The idea is to construct an undirected loop-free Double Vertex Graph for determining optimal shunting routes consisting of several half-runs for several trains shunting under draw-out tracks capacity constraints. Experimental results on the rail yard simulation model are presented.

Keywords

spatial-temporal graph; rail yard; dynamic transportation system; shunting operations; shunting route; double vertex graph; simulation; rail yard

Subject

Engineering, Transportation Science and Technology

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.