Method to get an shortest path for Turn-restriction, U-turn, and P-turn in Traffic Network using Dijkstra and Floyd-Warshall Algorithm

摘要

1. the art that the invention set forth in the claims ; The invention of motor rotation, U-turn, blood-turn to consideration of the Dijkstra algorithm or Floyd - Shortest Path Calculation Algorithm using wosyeol. ; 2. The invention is to solve the technical challenges ; The present invention, motor rotation, U-turn, P-turn is considering the Dijkstra algorithm or the Floyd - recording a program for realizing the method and the method calculates the shortest path to compute the shortest path from the transport network using the wosyeol algorithm computer in intended to provide a recording medium that can be read. ; 3. The gist of the solution of the invention, ; The present invention prohibits rotation applied to the shortest path calculation system, U-turns, avoid - in turn to the multi Calculating the shortest path using Dijkstra Algorithm, select the source and destination ban rotation, U-turn or avoid - in case that the turn comprising: a first step of allocating a virtual hogap based on the traffic information; In the second stage all the starting node to select the shortest travel time, total travel time from any node to node with a temporary label that gives a permanent label; And starting from the destination node includes a third stage to track the persistent node to determine the shortest path. ; 4. important use of the invention ; The present invention calculates the shortest path etc. yiyongdoem service. ; Shortest path algorithm is Dijkstra (Dijkstra Algorithm), Floyd - wosyeol algorithms, dynamic route guidance system (DRGS: Dynamic Route Guidance System), a virtual call connection (virtual arc connection), a virtual node (virtual node)