The University of Massachusetts Amherst
University of Massachusetts Amherst

Search Google Appliance

Links

Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks

TitleReal-time traveler information for optimal adaptive routing in stochastic time-dependent networks
Publication TypeJournal Article
Year of Publication2012
AuthorsGao S, Huang H
JournalTransportation Research Part C
Volume21
Issue1
Start Page196
Pagination196-213
Date Published04/2012
KeywordsRandom variables, Real-time systems, Routing, Stochastic processes, Traffic control
Abstract

Real-time information can enable travelers to adapt to changing traffic conditions and make better routing decisions in uncertain networks. In this paper, a generic description of real-time online information is provided based on three schemes using partial online information and one scheme with no online information. A theoretical analysis shows that more error-free information is always better than (or at least as good as) less information for optimal adaptive routing in flow-independent networks. A heuristic algorithm is designed for the optimal adaptive routing problem for all the four information schemes, based on a set of necessary conditions for optimality. The effectiveness of the heuristic algorithm is shown to be satisfactory over the tested random networks. This study is of interest for traveler information system evaluation and design.

DOI10.1016/j.trc.2011.09.007
Full Text

Real-time information can enable travelers to adapt to changing traffic conditions and make better routing decisions in uncertain networks. In this paper, a generic description of real-time online information is provided based on three schemes using partial online information and one scheme with no online information. A theoretical analysis shows that more error-free information is always better than (or at least as good as) less information for optimal adaptive routing in flow-independent networks. A heuristic algorithm is designed for the optimal adaptive routing problem for all the four information schemes, based on a set of necessary conditions for optimality. The effectiveness of the heuristic algorithm is shown to be satisfactory over the tested random networks. This study is of interest for traveler information system evaluation and design.