Evaluation of estimated shortest travel time using traffic network simulation

Shortest path finding is an essential function of a route guidance system (RGS). This shortest travel time is estimated by applying various shortest path algorithms to the traffic network that has deterministic or dynamic link travel times. Because it is difficult to evaluate these shortest path-fin...

Full description

Saved in:
Bibliographic Details
Published inIEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028) Vol. 4; pp. 586 - 588 vol.4
Main Authors Hojung Kim, Khonghee Choi, Byungha Ahn
Format Conference Proceeding
LanguageEnglish
Published IEEE 1999
Subjects
Delay effects
Delay estimation
Electronic mail
Mechatronics
Performance evaluation
Telecommunication traffic
Traffic control
Turning
Vehicle dynamics
Vehicles
Online AccessGet full text

Cover

More Information
Summary:Shortest path finding is an essential function of a route guidance system (RGS). This shortest travel time is estimated by applying various shortest path algorithms to the traffic network that has deterministic or dynamic link travel times. Because it is difficult to evaluate these shortest path-finding algorithms in real traffic situations, most are evaluated on a virtual traffic network. However, because experimental networks only link travel time statically and ignore the dynamic characteristics of the real traffic situation, so accurate evaluation of estimated travel time can not be performed. The objective of this paper is to evaluate the accuracy of planned shortest travel time in static or dynamic traffic networks using simulation traffic data and the effect of turning movement delay time to travel time.
ISBN:9780780357310
0780357310
ISSN:1062-922X
2577-1655
DOI:10.1109/ICSMC.1999.812469