Dynamic route search algorithms of a traffic network

Abstract

This paper studies two dynamic route search algorithms of a traffic network which play an essential role in dynamic route guidance systems. The traffic network is represented by taking effects of moving directions of motor-cars and offset control into account. Two dynamic route search algorithms are presented in a traffic network: one is the shortest distance route algorithm, and other is the shortest mean travel time route algorithm. The mean travel time from a driver's current position to his destination is evaluated by summing up mean travel time of each link. The two dynamic route search algorithms are simulated in a traffic network.