A Bidirectional Heuristic Shortest Path Algorithm with Turn Prohibitions and Delays

Firstly,a node-based topology relationship model of transport network is presented,in which the physical connection and the logical connection are described.Secondly,the structure of search node is defined in the sight of dual graph theory as a solution for turn prohibitions and delays in road intersections.At last,a bidirectional heuristic A~(*) algorithm based on search node is examined.