Yen 알고리즘을 활용한 열차 다중경로 탐색

초록

The purpose of this study is to examine methodologies to find the K-shortest paths between origins and destinations to increase the feasibility and effectiveness of the optimal railway operation alternatives. A methodology for finding possible routes in a railway network using Yen’s algorithm, which is a K-shortest paths algorithm, is presented. In addition, a network construction method considering railway facilities was also proposed. Using the network data of the high-density area of the Gyeongbu Line, the applicability of Yen’s algorithm was verified, and a method of using K-paths for real-time automatic control was proposed with the computation time. Using the results of this study, domestic train operation alternatives can be expanded from reordering to rerouting.

키워드