Dynamic route search algorithms of a traffic network

Author

Kobayashi, Masa-Aki ; Shimizu, Fikaru ; Yonezawa, Yoh

Author_Institution

Dept. of Mech. Eng., Fukuyama Univ., Japan

fYear

1997

fDate

29-31 Jul 1997

Firstpage

1211

Lastpage

1216

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 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

Keywords

driver information systems; navigation; optimisation; road traffic; search problems; traffic control; dynamic route search algorithms; offset control; road traffic; route guidance; shortest distance route; shortest mean travel time route; urban traffic network; Cities and towns; Communication system traffic control; Delay effects; Heuristic algorithms; Information processing; Mechanical engineering; Routing; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

SICE '97. Proceedings of the 36th SICE Annual Conference. International Session Papers

Conference_Location

Tokushima

Type

conf

DOI

10.1109/SICE.1997.624983

Filename

624983