Finding shortest path to non-stop intersection for future transportation

transportation Oanh Tran Thi Kim, Jun Hyeong Lee, Ji Yeon Kim, Choong Seon Hong Department of Computer Engineering, Kyung Hee University {ttkoanh, wnsgud3014, nabillee, cshong}@khu.ac.kr Abstract Shortest path query is an important problem and has been well studied in static graphs. However, in practice, there are many factors that influence cost of edges such as weather, time of day, and vehicle type. Then, the costs of edges in graphs always change over time. Therefore, finding shortest path needs to be considered not only distance but also factors affecting road speed. In this paper, we addressed the problem of computing fastest paths underlying future transportation with traffic speed patterns to non-stop intersections. A system model is proposed to show how a finding path processing is performed in future transportation. By defining the path cost, we propose an efficient finding path algorithm to compute a costoptimal path.