PageRank-Based Alternative Route Generation Algorithm for Resolving Train Conflicts

초록

In train conflict situations, changing the train route can significantly reduce train delays. However, in highdensity sections with short intervals and complex linear structures, generating effective alternative routes is challenging because the number of possible routes increases exponentially, making it practically impossible to consider all alternatives in real time. Conventional experience-based alternative route generation methods select from a limited set of routes and may therefore exclude potentially more efficient paths. This study proposes a method that quantitatively identifies sections with a high likelihood of conflict using a train？route graph and the PageRank algorithm, and generates alternative routes within those sections. When applied to the Seoul？Geumcheon-gu Office section, the proposed method was shown to reduce total train delay by approximately 60% compared to the case where alternative routes were not used.

키워드