Shortest Path Navigation for a Mix of Undirected and One-Way Roads Using k-SPT Method

This paper focuses on the shortest path navigation using map database. The k-shortest path query in this paper is described as follows. Given a departure point, a destination point and a set of candidate transit points, a computer system will return the shortest path that includes the candidate transit points. The k- shortest path (k-SPT) method was proposed to evaluate k-shortest path query efficiently. However, previous k- SPT method does not work correctly if map database includes one-way roads. In this paper, a problem of k- SPT method is explained, and a modified version of k- SPT is proposed that works correctly for map database that includes a mix of undirected and one-way roads.