Route-based Train Conflict Resolution Model Extended from Alternative Graph

This paper proposes a new route-based train conflict resolution model that considers the diverse interlocking logic of the railway system. This model is based on an alternative graph, which represents trains as jobs, track-circuits as machines, and the occupation time of a train on a track-circuit as the processing time of a job on a machine. The new model allows us to abstract the conflict at route level and significantly reduces computation effort to obtain a conflictfree schedule. Additionally, we develop a route-based heuristic algorithm and conduct numerical experiments to verify its performance. The results obtained by a case study on the Seoul-Yongsan area reveal that, compared with the previous dispatching algorithm (AMCC), the proposed algorithm reduces computation time and total delay time by approximately 55% and 26% respectively.