IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v367y2006icp461-478.html
   My bibliography  Save this article

A composite traffic flow modeling approach for incident-responsive network traffic assignment

Author

Listed:
  • Sheu, Jiuh-Biing

Abstract

This paper presents a hybrid traffic simulation-based model to address the network traffic route choice issue under conditions of lane-blocking incidents on surface streets. The proposed approach includes four sequential mechanisms: (1) link flow loading, (2) link traffic moving, (3) link cost calculation, and (4) searching the shortest path. To deal with the traffic flows moving on lane-blocking links, specific incident-induced link traffic flow models, which are extended from the Lighthill–Whitham (L–W for short) model, are formulated. A simulation-based approach is then proposed to determine the instantaneous shortest path associated with each vehicle approaching to each given intersection on the network. In addition, numerical examples associated with diverse incident scenarios are investigated. The numerical results demonstrate the competitiveness of the proposed simulation-based method by reducing the network-wide path travel time by 11.4% and the incident impact on link traffic flows by 66.7% in comparison with the Paramics traffic simulator. It is expected that this study can provide linkage between the fields of incident management and dynamic traffic assignment that will allow the development of such related technologies as real-time incident-responsive route guidance and incident management systems.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:367:y:2006:i:c:p:461-478
    DOI: 10.1016/j.physa.2005.11.039
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437105011945
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2005.11.039?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. Ziyou, Gao & Yifan, Song, 2002. "A reserve capacity model of optimal signal control with user-equilibrium route choice," Transportation Research Part B: Methodological, Elsevier, vol. 36(4), pages 313-323, May.
    2. Deepak K. Merchant & George L. Nemhauser, 1978. "Optimality Conditions for a Dynamic Traffic Assignment Model," Transportation Science, INFORMS, vol. 12(3), pages 200-207, August.
    3. Carlos F. Daganzo, 1998. "Queue Spillovers in Transportation Networks with a Route Choice," Transportation Science, INFORMS, vol. 32(1), pages 3-11, February.
    4. Huang, Hai-Jun & Lam, William H. K., 2002. "Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 253-273, March.
    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. Ran, Bin & Rouphail, Nagui M. & Tarko, Andrzej & Boyce, David E., 1997. "Toward a class of link travel time functions for dynamic assignment models on signalized networks," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 277-290, August.
    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. Moshe Ben-Akiva & Andre de Palma & Pavlos Kanaroglou, 1986. "Dynamic Model of Peak Period Traffic Congestion with Elastic Arrival Rates," Transportation Science, INFORMS, vol. 20(3), pages 164-181, August.
    9. Terry L. Friesz & Javier Luque & Roger L. Tobin & Byung-Wook Wie, 1989. "Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem," Operations Research, INFORMS, vol. 37(6), pages 893-901, December.
    10. Jayakrishnan, R. & Tsai, Wei T. & Prashker, Joseph N. & Rajadhyaksha, Subodh, 1994. "A Faster Path-Based Algorithm for Traffic Assignment," University of California Transportation Center, Working Papers qt2hf4541x, University of California Transportation Center.
    11. Chen, Huey-Kuo & Hsueh, Che-Fu, 1998. "A model and an algorithm for the dynamic user-optimal route choice problem," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 219-234, April.
    12. Wie, Byung-Wook & Friesz, Terry L. & Tobin, Roger L., 1990. "Dynamic user optimal traffic assignment on congested multidestination networks," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 431-442, December.
    13. Sheu, Jiuh-Biing & Chou, Yi-Hwa & Shen, Liang-Jen, 2001. "A stochastic estimation approach to real-time prediction of incident effects on freeway traffic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 575-592, July.
    14. 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.
    15. Abdulhai, Baher & Sheu, Jiuh-Biing & Recker, Will, 1999. "Simulation of ITS on the Irvine FOT Area Using "Paramics 1.5" Scalable Microscopic Traffic Simulator: Phase I: Model Calibration and Validation," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt2ks86938, Institute of Transportation Studies, UC Berkeley.
    16. MERCHANT, Deepak K. & NEMHAUSER, George L., 1978. "A model and an algorithm for the dynamic traffic assignment problems," LIDAM Reprints CORE 346, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. Papageorgiou, Markos, 1990. "Dynamic modeling, assignment, and route guidance in traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 471-495, December.
    18. Cho, Hsun-Jung & Smith, Tony E. & Friesz, Terry L., 2000. "A reduction method for local sensitivity analyses of network equilibrium arc flows," Transportation Research Part B: Methodological, Elsevier, vol. 34(1), pages 31-51, January.
    19. Sheu, Jiuh-Biing & Ritchie, Stephen G., 2001. "Stochastic modeling and real-time prediction of vehicular lane-changing behavior," Transportation Research Part B: Methodological, Elsevier, vol. 35(7), pages 695-716, August.
    20. Deepak K. Merchant & George L. Nemhauser, 1978. "A Model and an Algorithm for the Dynamic Traffic Assignment Problems," Transportation Science, INFORMS, vol. 12(3), pages 183-199, August.
    21. MERCHANT, Deepak K. & NEMHAUSER, George L., 1978. "Optimality conditions for a dynamic traffic assignment model," LIDAM Reprints CORE 345, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Xiao, Jianli, 2019. "SVM and KNN ensemble learning for traffic incident detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 517(C), pages 29-35.
    2. HongSheng Qi & DianHai Wang & Peng Chen & YiMing Bie, 2014. "Location-Dependent Lane-Changing Behavior for Arterial Road Traffic," Networks and Spatial Economics, Springer, vol. 14(1), pages 67-89, March.
    3. Anderson, Paul & Geroliminis, Nikolas, 2020. "Dynamic lane restrictions on congested arterials," Transportation Research Part A: Policy and Practice, Elsevier, vol. 135(C), pages 224-243.

    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. 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.
    2. Ran, Bin & Boyce, David E., 1995. "Ideal Dynamic User-Optimal Route Choice: A Link-Based Variational Inequality Formulation," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3t4686x6, Institute of Transportation Studies, UC Berkeley.
    3. Lam, William H. K. & Huang, Hai-Jun, 1995. "Dynamic user optimal traffic assignment model for many to one travel demand," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 243-259, August.
    4. Lu, Gongyuan & Nie, Yu(Marco) & Liu, Xiaobo & Li, Denghui, 2019. "Trajectory-based traffic management inside an autonomous vehicle zone," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 76-98.
    5. Friesz, Terry L. & Kim, Taeil & Kwon, Changhyun & Rigdon, Matthew A., 2011. "Approximate network loading and dual-time-scale dynamic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 176-207, January.
    6. Lam, William H. K. & Yin, Yafeng, 2001. "An activity-based time-dependent traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 549-574, July.
    7. 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.
    8. Chen, Huey-Kuo & Hsueh, Che-Fu, 1998. "A model and an algorithm for the dynamic user-optimal route choice problem," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 219-234, April.
    9. Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.
    10. Long, Jiancheng & Szeto, W.Y. & Gao, Ziyou & Huang, Hai-Jun & Shi, Qin, 2016. "The nonlinear equation system approach to solving dynamic user optimal simultaneous route and departure time choice problems," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 179-206.
    11. 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.
    12. Long, Jiancheng & Szeto, W.Y. & Du, Jie & Wong, R.C.P., 2017. "A dynamic taxi traffic assignment model: A two-level continuum transportation system approach," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 222-254.
    13. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    14. Jiancheng Long & Hai-Jun Huang & Ziyou Gao & W. Y. Szeto, 2013. "An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem," Operations Research, INFORMS, vol. 61(5), pages 1134-1147, October.
    15. 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).
    16. Lu, Chung-Cheng & Mahmassani, Hani S. & Zhou, Xuesong, 2009. "Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 345-364, March.
    17. Huang, Hai-Jun & Lam, William H. K., 2002. "Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 253-273, March.
    18. Zhang, Pinchao & Qian, Sean, 2020. "Path-based system optimal dynamic traffic assignment: A subgradient approach," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 41-63.
    19. Han, Sangjin, 2007. "A route-based solution algorithm for dynamic user equilibrium assignments," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1094-1113, December.
    20. Moore, II, James E. & Kim, Geunyoung & Cho, Seongdil & Hu, Hsi-hwa & Xu, Rong, 1997. "Evaluating System ATMIS Technologies Via Rapid Estimation Of Network Flows: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5c70f3d9, Institute of Transportation Studies, UC Berkeley.

    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:phsmap:v:367:y:2006:i:c:p:461-478. 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.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.