DocumentCode
2397692
Title
The model and algorithm for finding the optimal route in a dynamic road network
Author
Zhimin, A. Wang ; Xianfeng, B. Liu
Volume
2
fYear
2003
fDate
12-15 Oct. 2003
Firstpage
1495
Abstract
When finding the optimal route in a road network, the dynamic property of the network should be taken into account. Based on the Dijkstra algorithms, this paper put forward a new algorithm to find the shortest path within the limit of travel time in a dynamic road network, and provided some available methods to choose the optimal departure time and delivering route for the road transport organizers.
Keywords
operations research; transport control; Dijkstra algorithms; delivering route; dynamic road network; optimal departure time; optimal route; road transport organizers; Bridges; Cities and towns; Cost function; Intelligent networks; Navigation; Road transportation; Stochastic processes; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Transportation Systems, 2003. Proceedings. 2003 IEEE
Print_ISBN
0-7803-8125-4
Type
conf
DOI
10.1109/ITSC.2003.1252733
Filename
1252733
Link To Document