Dynamic route search algorithms of a traffic network

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 the effects of the moving directions of motor-cars and the offset control into account. Two dynamic route search algorithms are presented in a traffic network: one is “the shortest distance route algorithm”, and the 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 the mean travel time of each link. The two dynamic route search algorithms are simulated in a traffic network