| 摘要 |
A method is presented for finding a shortest path from a starting place to a destination place in a traffic network including one or more turn restrictions, one or more U-turns and one or more P-turns using a Dijkstra algorithm. The method as sets a virtual arc between nodes, and assigns a virtual arc value. A smallest travel time value is selected out of total travel time values for all nodes except for the starting node, by considering existing arcs between nodes and the virtual arc and assigning the smallest travel time value to a permanent label node. The shortest path is determined by tracing the permanent nodes starting from the destination node.
|
