IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v13y2013i2p183-203.html
   My bibliography  Save this article

A Hybrid Route Choice Model for Dynamic Traffic Assignment

Author

Listed:
  • Zhen Qian
  • H. Zhang

Abstract

Network user equilibrium or user optimum is an ideal state that can hardly be achieved in real traffic. More often than not, every day traffic tends to be in disequilibrium rather than equilibrium, thanks to uncertainties in demand and supply of the network. In this paper we propose a hybrid route choice model for studying non-equilibrium traffic. It combines pre-trip route choice and en-route route choice to solve dynamic traffic assignment (DTA) in large-scale networks. Travelers are divided into two groups, habitual travelers and adaptive travelers. Habitual travelers strictly follow their pre-trip routes which can be generated in the way that major links, such as freeways or major arterial streets, are favored over minor links, while taking into account historical traffic information. Adaptive travelers are responsive to real-time information and willing to explore new routes from time to time. We apply the hybrid route choice model in a synthetic medium-scale network and a large-scale real network to assess its effect on the flow patterns and network performances, and compare them with those obtained from Predictive User Equilibrium (PUE) DTA. The results show that PUE-DTA usually produces considerably less congestion and less frequent queue spillback than the hybrid route choice model. The ratio between habitual and adaptive travelers is crucial in determining realistic flow and queuing patterns. Consistent with previous studies, we found that, in non-PUE DTA, supplying a medium sized group (usually less than 50%) of travelers real-time information is more beneficial to network performance than supplying the majority of travelers with real-time information. Finally, some suggestions are given on how to calibrate the hybrid route choice model in practice to produce realistic results. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • Zhen Qian & H. Zhang, 2013. "A Hybrid Route Choice Model for Dynamic Traffic Assignment," Networks and Spatial Economics, Springer, vol. 13(2), pages 183-203, June.
    • Handle: RePEc:kap:netspa:v:13:y:2013:i:2:p:183-203
    DOI: 10.1007/s11067-012-9177-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-012-9177-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-012-9177-z?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. Daganzo, Carlos F., 1995. "The cell transmission model, part II: Network traffic," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 79-93, April.
    2. Gao, Song & Frejinger, Emma & Ben-Akiva, Moshe, 2011. "Cognitive cost in route choice with real-time information: An exploratory analysis," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(9), pages 916-926, November.
    3. Smith, M. J., 1993. "A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 27(1), pages 49-63, February.
    4. Carlos F. Daganzo, 1998. "Queue Spillovers in Transportation Networks with a Route Choice," Transportation Science, INFORMS, vol. 32(1), pages 3-11, February.
    5. Bin Ran & David E. Boyce & Larry J. LeBlanc, 1993. "A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models," Operations Research, INFORMS, vol. 41(1), pages 192-202, February.
    6. Jin, W. L. & Zhang, H. M., 2003. "On the distribution schemes for determining flows through a merge," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 521-540, July.
    7. Daganzo, Carlos F., 1994. "The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory," Transportation Research Part B: Methodological, Elsevier, vol. 28(4), pages 269-287, August.
    8. Kuwahara, Masao & Akamatsu, Takashi, 2001. "Dynamic user optimal assignment with physical queues for a many-to-many OD pattern," Transportation Research Part B: Methodological, Elsevier, vol. 35(5), pages 461-479, June.
    9. Yu Nie & H. Zhang, 2010. "Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback," Networks and Spatial Economics, Springer, vol. 10(1), pages 49-71, March.
    10. Yang, Reddy H & Vaughn, K M & Abdel-Aty, M A & Kitamura, R & Jovanis, P P, 1995. "Design of an Artificial Simulator for Analyzing Route Choice Behavior in the Presence of Information System," Institute of Transportation Studies, Working Paper Series qt93x4h7pp, Institute of Transportation Studies, UC Davis.
    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. Schlicher, Loe & Lurkin, Virginie, 2024. "Fighting pickpocketing using a choice-based resource allocation model," European Journal of Operational Research, Elsevier, vol. 315(2), pages 580-595.
    2. Albert Solé-Ribalta & Sergio Gómez & Alex Arenas, 2018. "Decongestion of Urban Areas with Hotspot Pricing," Networks and Spatial Economics, Springer, vol. 18(1), pages 33-50, March.
    3. Yongxi Huang & Shengyin Li & Zhen Qian, 2015. "Optimal Deployment of Alternative Fueling Stations on Transportation Networks Considering Deviation Paths," Networks and Spatial Economics, Springer, vol. 15(1), pages 183-204, March.
    4. Wu, Chengyuan & Yang, Liangze & Du, Jie & Pei, Xin & Wong, S.C., 2024. "Continuum dynamic traffic models with novel local route-choice strategies for urban cities," Transportation Research Part B: Methodological, Elsevier, vol. 181(C).
    5. N. Nezamuddin & Stephen Boyles, 2015. "A Continuous DUE Algorithm Using the Link Transmission Model," Networks and Spatial Economics, Springer, vol. 15(3), pages 465-483, September.

    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. Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2005. "A within-day dynamic traffic assignment model for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 39(1), pages 1-29, January.
    2. Flötteröd, Gunnar & Rohde, Jannis, 2011. "Operational macroscopic modeling of complex urban road intersections," Transportation Research Part B: Methodological, Elsevier, vol. 45(6), pages 903-922, July.
    3. Bar-Gera, Hillel & Carey, Malachy, 2022. "Constructing a cell transmission model solution adhering fully to first-in-first-out conditions," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 247-267.
    4. Nie, Yu (Marco), 2010. "Equilibrium analysis of macroscopic traffic oscillations," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 62-72, January.
    5. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun & Gao, Ziyou, 2015. "An intersection-movement-based stochastic dynamic user optimal route choice model for assessing network performance," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 182-217.
    6. Babak Javani & Abbas Babazadeh, 2020. "Path-Based Dynamic User Equilibrium Model with Applications to Strategic Transportation Planning," Networks and Spatial Economics, Springer, vol. 20(2), pages 329-366, June.
    7. Tong, C. O. & Wong, S. C., 2000. "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 625-644, November.
    8. Gentile, Guido & Meschini, Lorenzo & Papola, Natale, 2007. "Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1114-1138, December.
    9. Georgia Perakis & Guillaume Roels, 2006. "An Analytical Model for Traffic Delays and the Dynamic User Equilibrium Problem," Operations Research, INFORMS, vol. 54(6), pages 1151-1171, December.
    10. Sheu, Jiuh-Biing, 2006. "A composite traffic flow modeling approach for incident-responsive network traffic assignment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 367(C), pages 461-478.
    11. Blumberg, Michal & Bar-Gera, Hillel, 2009. "Consistent node arrival order in dynamic network loading models," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 285-300, March.
    12. Ran, Bin & Hall, Randolph W. & Boyce, David E., 1996. "A link-based variational inequality model for dynamic departure time/route choice," Transportation Research Part B: Methodological, Elsevier, vol. 30(1), pages 31-46, February.
    13. Nie, Yu (Marco) & Zhang, H.M., 2008. "A variational inequality formulation for inferring dynamic origin-destination travel demands," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 635-662, August.
    14. S. Waller & Athanasios Ziliaskopoulos, 2006. "A Combinatorial user optimal dynamic traffic assignment algorithm," Annals of Operations Research, Springer, vol. 144(1), pages 249-261, April.
    15. Carey, Malachy & Humphreys, Paul & McHugh, Marie & McIvor, Ronan, 2014. "Extending travel-time based models for dynamic network loading and assignment, to achieve adherence to first-in-first-out and link capacities," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 90-104.
    16. Friesz, Terry L. & Han, Ke & Neto, Pedro A. & Meimand, Amir & Yao, Tao, 2013. "Dynamic user equilibrium based on a hydrodynamic model," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 102-126.
    17. Chi Xie & Jennifer Duthie, 2015. "An Excess-Demand Dynamic Traffic Assignment Approach for Inferring Origin-Destination Trip Matrices," Networks and Spatial Economics, Springer, vol. 15(4), pages 947-979, December.
    18. Hong Zheng & Yi-Chang Chiu, 2011. "A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 45(1), pages 121-137, February.
    19. Nie, Yu (Marco), 2011. "A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 329-342, February.
    20. Carey, Malachy, 2021. "The cell transmission model with free-flow speeds varying over time or space," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 245-257.

    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:kap:netspa:v:13:y:2013:i:2:p:183-203. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.