Adaptive Route Choice Models in Stochastic Time-Dependent Networks
Abstract
Adaptive route choice models are studied that explicitly capture travelers’ route choice adjustments according to information on realized network conditions in stochastic time-dependent networks. Two types of adaptive route choice models are explored: an adaptive path model in which a sequence of path choice models are applied at intermediate decision nodes and a routing policy choice model in which the alternatives correspond to routing policies rather than paths at the origin. A routing policy in this study is a decision rule that maps from all possible pairs (e.g., node, time) to the next links out of the node. Existing route choice models that can be estimated on disaggregate revealed preferences assume a deterministic network setting from the traveler's perspective and cannot capture the traveler's proactive adaptive behavior under uncertain traffic conditions. The literature includes a number of algorithmic studies of optimal routing policy problems, but the estimation of a routing policy choice model is a new research area. The specifications of estimating the two adaptive route choice models are established and the feasibility of estimation from path observations is demonstrated on an illustrative network. Prediction results from three models–nonadaptive path model, adaptive path model, and routing policy model–are compared. The routing policy model is shown to better capture the option value of diversion than the adaptive path model. The difference between the two adaptive models and the nonadaptive model is larger in terms of expected travel time if the network is more stochastic, indicating that the benefit of adaptivity is more significant in a more unpredictable network.
Get full access to this article
View all access and purchase options for this article.
References
1. Ben-Akiva M. and Bierlaire M. Discrete Choice Methods and Their Applications to Short-Term Travel Decisions. In Handbook of Transportation Science Hall (R. ed.), Kluwer, Netherlands, 1999, pp. 5–34.
2. Cascetta E. Nuzzolo A. Russo F. and Vitetta A. A Modified Logit Route Choice Model Overcoming Path Overlapping Problems: Specification and Some Calibration Results for Interurban Networks. In Proceedings of the 13th International Symposium on Transportation and Traffic Theory Lesort (J.-B. ed.), Lyon, France, Elsevier Science, 1996.
3. Vovsha P. and Bekhor S. Link-Nested Logit Model of Route Choice: Overcoming Route Overlapping Problem. In Transportation Research Record 1645, TRB, National Research Council, Washington, D.C., 1998, pp. 133–142.
4. Ramming M. S. Network Knowledge and Route Choice. PhD thesis. Massachusetts Institute of Technology, Cambridge, 2001.
5. Bekhor S. Ben-Akiva M. and Ramming M. S. Adaptation of Logit Kernel to Route Choice Situation. In Transportation Research Record: Journal of the Transportation Research Board, No. 1805, Transportation Research Board of the National Academies, Washington, D.C., 2002, pp. 78–85.
6. Frejinger E. and Bierlaire M. Capturing Correlation with Subnetworks in Route Choice Models. Transportation Research, Vol. 41B, No. 3, 2007, pp. 363–378.
7. Ben-Akiva M. Bierlaire M. Koutsopoulos H. N. and Mishalani R. Real-Time Simulation of Traffic Demand-Supply Interactions Within DynaMIT. In Transportation and Network Analysis: Current Trends. Miscellenea in Honor of Michael Florian Gendreau (M. and Marcotte P. eds.), Kluwer, Netherlands, 2002, pp. 19–36.
8. Mahmassani H. S. Dynamic Network Traffic Assignment and Simulation Methodology for Advanced System Management Applications. Network and Spatial Economics, Vol. 1, 2001, pp. 267–292.
9. Balakrishna R. Off-line Calibration of Dynamic Traffic Assignment Models. PhD dissertation. Massachusetts Institute of Technology, Cambridge, 2006.
10. Balakrishna R. Ben-Akiva M. and Koutsopoulos H. N. Off-line Calibration of Dynamic Traffic Assignment: Simultaneous Demand–Supply Estimation. In Transportation Research Record: Journal of the Transportation Research Board, No. 2003, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 50–58.
11. Srinivasan K. K. and Mahmassani H. Analyzing Heterogeneity and Unobserved Structural Effects in Route-Switching Behavior Under ATIS: A Dynamic Kernel Logit Formulation. Transportation Research, Vol. 37B, 2003, pp. 793–814.
12. Abdel-Aty M. A. and Abdalla M. F. Examination of Multiple Mode/Route-Choice Paradigms Under ATIS. IEEE Transactions on Intelligent Transportation Systems, Vol. 7, No. 3 2006, pp. 332–348.
13. Polydoropoulou A. Ben-Akiva M. Khattack A. and Lauprete G. Modeling Revealed and Stated En-Route Travel Response to Advanced Traveler Information Systems. In Transportation Research Record 1537, TRB, National Research Council, Washington, D.C., 1996, pp. 38–45.
14. Abdel-Aty M. and Abdalla M. F. Modeling Drivers’ Diversions from Normal Routes Under ATIS Using Generalized Estimating Equations and Binomial Probit Link Function. Transportation, Vol. 31, 2004, pp. 327–348.
15. Mahmassani H. and Liu Y. Dynamics of Commuting Decision Behavior Under Advanced Traveler Information Systems. Transportation Research, Vol. 7C, No. 2/3, 1999, pp. 91–107.
16. Bogers E. A. I. Viti F. and Hoogendoorn S. P. Joint Modeling of Advanced Travel Information Service, Habit, and Learning Impacts on Route Choice by Laboratory Simulator Experiments. In Transportation Research Record: Journal of the Transportation Research Board, No. 1926, Transportation Research Board of the National Academies, Washington, D.C., 2005, pp. 189–197.
17. Peeta S. and Yu J. W. A Hybrid Model for Driver Route Choice Incorporating En-Route Attributes and Real-Time Information Effects. Networks and Spatial Economics, Vol. 5, 2005, pp. 21–40.
18. Gao S. and Chabini I. Optimal Routing Policy Problems in Stochastic Time-Dependent Networks. Transportation Research, Vol. 40B, No. 2, 2006, pp. 93–122.
19. Hall R. W. The Fastest Path Through a Network with Random Time-Dependent Travel Times. Transportation Science, Vol. 20, No. 3 1986, pp. 91–101.
20. Polychronopoulos G. and Tsitsiklis J. N. Stochastic Shortest Path Problems with Recourse. Networks, Vol. 27, 1996, pp. 133–143.
21. Marcotte P. and Nguyen S. Hyperpath Formulations of Traffic Assignment Problems. In Equilibrium and Advanced Transportation Modeling Marcotte (P. and Nguyen S. eds.), Kluwer, Netherlands, 1998, pp. 175–199.
22. Pretolani D. A Directed Hyperpath Model for Random Time Dependent Shortest Paths. European Journal of Operational Research, Vol. 123, 2000, pp. 315–324.
23. Miller-Hooks E. D. and Mahmassani H. S. Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks. Transportation Science, Vol. 34, No. 2 2000, pp. 198–215.
24. Miller-Hooks E. D. Adaptive Least-Expected Time Paths in Stochastic, Time-Varying Transportation and Data Networks. Networks, Vol. 37, No. 1 2001, pp. 35–52.
25. Waller S. T. and Ziliaskopoulos A. K. On the Online Shortest Path Problem with Limited Arc Cost Dependencies. Networks, Vol. 40, No. 4 2002, pp. 216–227.
26. Gao S. Optimal Adaptive Routing and Traffic Assignment in Stochastic Time-Dependent Networks. PhD dissertation. Massachusetts Institute of Technology, Cambridge, 2005.
27. Ukkusuri S. V. and Patil G. R. Exploring User Behavior in Online Network Equilibrium Problems. In 11th International Conference on Travel Behavior Research: Compendium of Papers (CD-ROM), Kyoto, Japan, Aug. 2006.
28. Bierlaire M. and Frejinger E. Route Choice Modeling with Network-Free Data. Transportation Research, Vol. 16C, No. 2, 2008, pp. 187–198.
29. Bierlaire M. Biogeme: A Free Package for the Estimation of Discrete Choice Models. In Proceedings of the 3rd Swiss Transport Research Conference, Ascona, Switzerland, 2003.
30. Bierlaire M. An Introduction to Biogeme Version 1.6. http://biogeme.epfl.ch. Accessed 2008.
31. de la Barra T. Perez B. and Anez J. Multidimensional Path Search and Assignment. In Proceedings of the 21st PTRC Summer Meeting, Manchester, United Kingdom, 1993, pp. 307–319.
32. Azevedo J. A. Santos Costa M. E. O. Silvestre Madeira J. J. E. R. and Vieira Martins E. Q. An Algorithm for the Ranking of Shortest Paths. European Journal of Operational Research, Vol. 69, 1993, pp. 97–106.
Cite article
Cite article
Cite article
OR
Download to reference manager
If you have citation software installed, you can download article citation data to the citation manager of your choice
Information, rights and permissions
Information
Published In
Article first published online: January 1, 2008
Issue published: January 2008
Authors
Metrics and citations
Metrics
Journals metrics
This article was published in Transportation Research Record: Journal of the Transportation Research Board.
VIEW ALL JOURNAL METRICSArticle usage*
Total views and downloads: 89
*Article usage tracking started in December 2016
Altmetric
See the impact this article is making through the number of times it’s been read, and the Altmetric Score.
Learn more about the Altmetric Scores
Articles citing this one
Receive email alerts when this article is cited
Web of Science: 0
Crossref: 33
- Global path preference and local response: A reward decomposition appr...
- Schedule-based transit assignment with online bus arrival information
- Proactive route choice with real-time information: Learning and effect...
- On Scalable Network Communication for Infrastructure-Vehicle Collabora...
- A Stochastic Dynamic Traffic Assignment Model for Emergency Evacuation...
- Looking-Ahead in Route Choice with Real-Time Information: Learning and...
- Adaptive Park-and-ride Choice on Time-dependent Stochastic Multimodal ...
- Developing a Dynamic Traffic Assignment Model for Large-Scale Networks...
- Routing policy choice prediction in a stochastic network: Recursive mo...
- Strategic Choices and Routing Within Service Networks: Modeling and Es...
- Simulation of rerouting phenomena in Dynamic Traffic Assignment with t...
- A latent-class adaptive routing choice model in stochastic time-depend...
- A mean field route choice game model
- Optimizing on-time arrival probability and percentile travel time for ...
- Incorporating Driver Behaviors in Network Design Problems: Challenges ...
- Reliable routing in stochastic time-dependent network with the use of ...
- Propagating Agents with Macroscopic Dynamic Network Loading: Challenge...
- Observing rerouting phenomena in dynamic traffic networks
- Route vs. Segment: An Experiment on Real‐Time Travel Information in Co...
- Whether to enter expressway or not? The impact of new variable message...
- INDIRECT OBSERVATION OF REROUTING PHENOMENA IN TRAFFIC NETWORKS – CASE...
- Considering En-Route Choices in Utility-Based Route Choice Modelling
- Applications of theories and models of choice and decision-making unde...
- Optimizing route choice in multimodal transportation networks
- DIRECT OBSERVATION OF REROUTING PHENOMENA IN TRAFFIC NETWORKS
- A rank-dependent expected utility model for strategic route choice wit...
- A DESCRIPTIVE DECISION-MAKING MODEL UNDER UNCERTAINTY: COMBINATION OF ...
- Shortest Paths in Stochastic Time-Dependent Networks with Link Travel ...
- Scheduled Hyperpath...
- A heterogeneous latent class model of activity rescheduling, route cho...
- Adaptive route choices in risky traffic networks: A prospect theory ap...
- Planning and Action in a Model of Choice
- Strategic Thinking and Risk Attitudes in Route Choice...
Figures and tables
Figures & Media
Tables
View Options
Get access
Access options
If you have access to journal content via a personal subscription, university, library, employer or society, select from the options below:
loading institutional access options
Alternatively, view purchase options below:
Purchase 24 hour online access to view and download content.
Access journal content via a DeepDyve subscription or find out more about this option.
