Threshold-based restricted searching area algorithm in dynamic route guidance system

Dynamic route guidance is one of the focal and difficult problems in Intelligent Transportation System(ITS). For the Dijkstra algorithm is difficult to meet the real-time requirement of the dynamic route guidance system, this paper proposes a threshold-based restricted searching area algorithm in the dynamic route guidance system. This algorithm, applied to the complicated urban road network model, realizes the optimal path search in the dynamic route guidance system. On basis of the classical Dijkstra algorithm, this algorithm introduces a threshold-based restricted searching area mechanism, that is, it uses the spatial distribution feature of the real road network to restrict the searching area by setting up a reasonable threshold value, which reduces its searching size, so as to enhance its efficiency. An actual example is given, and the experimental results verify the proposed algorithm is faster than traditional algorithms in large-scale urban road network, and it shows a good performance in the dynamic route guidance system.