IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v118y2018icp90-105.html
   My bibliography  Save this article

Asymptotic approximations of transient behaviour for day-to-day traffic models

Author

Listed:
  • Watling, David P.
  • Hazelton, Martin L.

Abstract

We consider a wide class of stochastic process traffic assignment models that capture the day-to-day evolving interaction between traffic congestion and drivers’ information acquisition and choice processes. Such models provide a description of not only transient change and ‘steady’ behaviour, but also represent additional variability that occurs through probabilistic descriptions. They are therefore highly suited to modelling both the disturbance and subsequent ‘drift’ of networks that are subject to some systematic change, be that a road closure or capacity reduction, new policy measure or general change in demand patterns. In this paper we derive analytic results to probabilistically capture the nature of the transient effects following such a systematic change. This can be thought of as understanding what happens as a system moves from varying about one equilibrium state to varying about a new equilibrium state. The results capture analytically the changes over time in descriptors of the system, in terms of link flow means, variances and covariances. Formally, the analytic results hold asymptotically as approximations, as we imagine demand increasing in tandem with capacities; however, our interest is in general cases where such tandem increases do not occur, and so we provide conditions under which our approximations are likely to work well. Numerical results of applying the methods are reported on several examples. The quality of the approximations is assessed through comparisons with Monte Carlo simulations from the true underlying process .

Suggested Citation

  • Watling, David P. & Hazelton, Martin L., 2018. "Asymptotic approximations of transient behaviour for day-to-day traffic models," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 90-105.
  • Handle: RePEc:eee:transb:v:118:y:2018:i:c:p:90-105
    DOI: 10.1016/j.trb.2018.10.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261518304521
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2018.10.010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jabari, Saif Eddin & Liu, Henry X., 2013. "A stochastic model of traffic flow: Gaussian approximation and estimation," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 15-41.
    2. Martin L. Hazelton & David P. Watling, 2004. "Computation of Equilibrium Distributions of Markov Traffic-Assignment Models," Transportation Science, INFORMS, vol. 38(3), pages 331-342, August.
    3. C. Cromvik & M. Patriksson, 2010. "On the Robustness of Global Optima and Stationary Solutions to Stochastic Mathematical Programs with Equilibrium Constraints, Part 2: Applications," Journal of Optimization Theory and Applications, Springer, vol. 144(3), pages 479-500, March.
    4. Nakayama, Shoichiro & Watling, David, 2014. "Consistent formulation of network equilibrium with stochastic flows," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 50-69.
    5. Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
    6. Gary A. Davis & Nancy L. Nihan, 1993. "Large Population Approximations of a General Stochastic Traffic Assignment Model," Operations Research, INFORMS, vol. 41(1), pages 169-178, February.
    7. C. Cromvik & M. Patriksson, 2010. "On the Robustness of Global Optima and Stationary Solutions to Stochastic Mathematical Programs with Equilibrium Constraints, Part 1: Theory," Journal of Optimization Theory and Applications, Springer, vol. 144(3), pages 461-478, March.
    8. G. E. Cantarella & D. P. Watling, 2016. "Modelling road traffic assignment as a day-to-day dynamic, deterministic process: a unified approach to discrete- and continuous-time models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 69-98, March.
    9. Wen-yi Zhang & Wei Guan & Ji-hui Ma & Jun-fang Tian, 2015. "A Nonlinear Pairwise Swapping Dynamics to Model the Selfish Rerouting Evolutionary Game," Networks and Spatial Economics, Springer, vol. 15(4), pages 1075-1092, December.
    10. Watling, David P., 2016. "A route-swapping dynamical system and Lyapunov function for stochastic user equilibriumAuthor-Name: Smith, Michael J," Transportation Research Part B: Methodological, Elsevier, vol. 85(C), pages 132-141.
    11. Zhu, Shanjiang & Levinson, David & Liu, Henry X. & Harder, Kathleen, 2010. "The traffic and behavioral effects of the I-35W Mississippi River bridge collapse," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(10), pages 771-784, December.
    12. Carolina Osorio & Linsen Chong, 2015. "A Computationally Efficient Simulation-Based Optimization Algorithm for Large-Scale Urban Transportation Problems," Transportation Science, INFORMS, vol. 49(3), pages 623-636, August.
    13. Katharina Parry & David P. Watling & Martin L. Hazelton, 2016. "A new class of doubly stochastic day-to-day dynamic traffic assignment models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 5-23, March.
    14. David Watling & Giulio Cantarella, 2015. "Model Representation & Decision-Making in an Ever-Changing World: The Role of Stochastic Process Models of Transportation Systems," Networks and Spatial Economics, Springer, vol. 15(3), pages 843-882, September.
    15. Osorio, Carolina & Flötteröd, Gunnar & Bierlaire, Michel, 2011. "Dynamic network loading: A stochastic differentiable model that derives link state distributions," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1410-1423.
    16. Song, Wenjing & Han, Ke & Wang, Yiou & Friesz, Terry L. & del Castillo, Enrique, 2018. "Statistical metamodeling of dynamic network loading," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 740-756.
    17. Anthony Chen & Zhong Zhou & Piya Chootinan & Seungkyu Ryu & Chao Yang & S. Wong, 2011. "Transport Network Design Problem under Uncertainty: A Review and New Developments," Transport Reviews, Taylor & Francis Journals, vol. 31(6), pages 743-768.
    18. Carlos F. Daganzo & Yosef Sheffi, 1977. "On Stochastic Models of Traffic Assignment," Transportation Science, INFORMS, vol. 11(3), pages 253-274, August.
    19. Cascetta, Ennio, 1989. "A stochastic process approach to the analysis of temporal dynamics in transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(1), pages 1-17, February.
    20. Boyer, Sebastien & Blandin, Sebastien & Wynter, Laura, 2015. "Stability of transportation networks under adaptive routing policies," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 886-903.
    21. Hazelton, Martin L., 2002. "Day-to-day variation in Markovian traffic assignment models," Transportation Research Part B: Methodological, Elsevier, vol. 36(7), pages 637-648, August.
    22. A. Arun Prakash & Karthik K. Srinivasan, 2017. "Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation," Networks and Spatial Economics, Springer, vol. 17(3), pages 809-840, September.
    23. Carolina Osorio & Jana Yamani, 2017. "Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks," Transportation Science, INFORMS, vol. 51(3), pages 823-840, August.
    24. G. E. Cantarella & E. Cascetta, 1995. "Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory," Transportation Science, INFORMS, vol. 29(4), pages 305-329, November.
    25. Liu, Ronghui & Van Vliet, Dirck & Watling, David, 2006. "Microsimulation models incorporating both demand and supply dynamics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 40(2), pages 125-150, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhu, Zheng & Mardan, Atabak & Zhu, Shanjiang & Yang, Hai, 2021. "Capturing the interaction between travel time reliability and route choice behavior based on the generalized Bayesian traffic model," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 48-64.
    2. Xiaozheng He & Jian Wang & Srinivas Peeta & Henry X. Liu, 2022. "Day-to-Day Signal Retiming Scheme for Single-Destination Traffic Networks Based on a Flow Splitting Approach," Networks and Spatial Economics, Springer, vol. 22(4), pages 855-882, December.
    3. Hazelton, Martin L., 2022. "The emergence of stochastic user equilibria in day-to-day traffic models," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 102-112.
    4. Zhong, R.X. & Xie, X.X. & Luo, J.C. & Pan, T.L. & Lam, W.H.K. & Sumalee, A., 2020. "Modeling double time-scale travel time processes with application to assessing the resilience of transportation systems," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 228-248.
    5. Sun, Mingmei, 2023. "A day-to-day dynamic model for mixed traffic flow of autonomous vehicles and inertial human-driven vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hazelton, Martin L., 2022. "The emergence of stochastic user equilibria in day-to-day traffic models," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 102-112.
    2. Paolo Delle Site, 2017. "On the Equivalence Between SUE and Fixed-Point States of Day-to-Day Assignment Processes with Serially-Correlated Route Choice," Networks and Spatial Economics, Springer, vol. 17(3), pages 935-962, September.
    3. Sun, Mingmei, 2023. "A day-to-day dynamic model for mixed traffic flow of autonomous vehicles and inertial human-driven vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    4. Zhu, Zheng & Mardan, Atabak & Zhu, Shanjiang & Yang, Hai, 2021. "Capturing the interaction between travel time reliability and route choice behavior based on the generalized Bayesian traffic model," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 48-64.
    5. David Watling & Giulio Cantarella, 2015. "Model Representation & Decision-Making in an Ever-Changing World: The Role of Stochastic Process Models of Transportation Systems," Networks and Spatial Economics, Springer, vol. 15(3), pages 843-882, September.
    6. Cantarella, Giulio E. & Watling, David P., 2016. "A general stochastic process for day-to-day dynamic traffic assignment: Formulation, asymptotic behaviour, and stability analysis," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 3-21.
    7. He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2010. "A link-based day-to-day traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 597-608, May.
    8. Katharina Parry & David P. Watling & Martin L. Hazelton, 2016. "A new class of doubly stochastic day-to-day dynamic traffic assignment models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 5-23, March.
    9. Martin L. Hazelton & David P. Watling, 2004. "Computation of Equilibrium Distributions of Markov Traffic-Assignment Models," Transportation Science, INFORMS, vol. 38(3), pages 331-342, August.
    10. G. E. Cantarella & D. P. Watling, 2016. "Modelling road traffic assignment as a day-to-day dynamic, deterministic process: a unified approach to discrete- and continuous-time models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 69-98, March.
    11. Meneguzzer, Claudio, 2022. "Day-to-day dynamics in a simple traffic network with mixed direct and contrarian route choice behaviors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 603(C).
    12. Rambha, Tarun & Boyles, Stephen D., 2016. "Dynamic pricing in discrete time stochastic day-to-day route choice models," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 104-118.
    13. Xu, Xiangdong & Qu, Kai & Chen, Anthony & Yang, Chao, 2021. "A new day-to-day dynamic network vulnerability analysis approach with Weibit-based route adjustment process," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    14. Jiayang Li & Zhaoran Wang & Yu Marco Nie, 2023. "Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice," Papers 2304.02500, arXiv.org, revised Feb 2024.
    15. Kumar, Amit & Peeta, Srinivas, 2015. "A day-to-day dynamical model for the evolution of path flows under disequilibrium of traffic networks with fixed demand," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 235-256.
    16. Xiaomei Zhao & Chunhua Wan & Jun Bi, 2019. "Day-to-Day Assignment Models and Traffic Dynamics Under Information Provision," Networks and Spatial Economics, Springer, vol. 19(2), pages 473-502, June.
    17. Jing Lu & Carolina Osorio, 2018. "A Probabilistic Traffic-Theoretic Network Loading Model Suitable for Large-Scale Network Analysis," Service Science, INFORMS, vol. 52(6), pages 1509-1530, December.
    18. Wang, Jian & He, Xiaozheng & Peeta, Srinivas, 2016. "Sensitivity analysis based approximation models for day-to-day link flow evolution process," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 35-53.
    19. Hazelton, Martin L., 2002. "Day-to-day variation in Markovian traffic assignment models," Transportation Research Part B: Methodological, Elsevier, vol. 36(7), pages 637-648, August.
    20. David Watling, 2002. "A Second Order Stochastic Network Equilibrium Model, I: Theoretical Foundation," Transportation Science, INFORMS, vol. 36(2), pages 149-166, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:118:y:2018:i:c:p:90-105. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.