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

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.

► More error-free information can do no worse for optimal adaptive routing. ► Bellman’s principle does not hold for a number of imperfect information problems. ► The heuristic based on necessary conditions for optimality performs well. ► Delays seem more detrimental to the value of information than spatial limitations.