IDEAS home Printed from https://ideas.repec.org/a/kap/transp/v33y2006i6p589-604.html
   My bibliography  Save this article

Computing dynamic user equilibria for large-scale transportation networks

Author

Listed:
  • Mansoureh Jeihani
  • Hanif Sherali
  • Antoine Hobeika

Abstract

In this paper, we present an approach for determining dynamic user equilibria. The method is suitable for disaggregated microscopic and mesoscopic simulation-based models. It is a modification of the convex-simplex method, which disposes with the line search step, and controls the subset of travelers to be re-routed at each step while updating the link travel times after each assignment. To guarantee finite termination, a suitable stopping criterion is adopted. The proposed method is implemented within TRANSIMS, the Transportation Analysis and Simulation System, as a two-stage process that employs a combined use of link performance functions and a microsimulator in order to design a framework suitable for application to real transportation systems. To demonstrate this capability, we apply the developed methodology to a large-scale network, Bignet, which is part of the transportation city network of Portland, Oregon; and a medium-scale network, Blacksburg, Virginia; and provide some comparative analyses. Our results exhibit that an improved distribution of travelers is obtained while consuming less than 17–33% of the effort required by the current version of TRANSIMS. Copyright Springer Science+Business Media B.V. 2006

Suggested Citation

  • Mansoureh Jeihani & Hanif Sherali & Antoine Hobeika, 2006. "Computing dynamic user equilibria for large-scale transportation networks," Transportation, Springer, vol. 33(6), pages 589-604, November.
    • Handle: RePEc:kap:transp:v:33:y:2006:i:6:p:589-604
    DOI: 10.1007/s11116-006-7473-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11116-006-7473-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11116-006-7473-5?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. Sang Nguyen, 1974. "An Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 8(3), pages 203-216, August.
    2. Lin, Wei-Hua & Lo, Hong K., 2000. "Are the objective and solutions of dynamic user-equilibrium models always consistent?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 34(2), pages 137-144, 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. Cheng, Liang-Chieh & Wang, Heng, 2013. "Modeling User Equilibrium in Microscopic Transportation Simulation," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 52(2).
    2. Liu, Jialin & Jiang, Rui & Liu, Yang & Jia, Bin & Li, Xingang & Wang, Ting, 2024. "Managing evacuation of multiclass traffic flow: Fleet configuration, lane allocation, lane reversal, and cross elimination," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(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. Hoang, Nam H. & Vu, Hai L. & Lo, Hong K., 2018. "An informed user equilibrium dynamic traffic assignment problem in a multiple origin-destination stochastic network," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 207-230.
    2. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    3. 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.
    4. Liu, Zhiyuan & Chen, Xinyuan & Hu, Jintao & Wang, Shuaian & Zhang, Kai & Zhang, Honggang, 2023. "An alternating direction method of multipliers for solving user equilibrium problem," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1072-1084.
    5. Xie, Chi, 2016. "New insights and improvements of using paired alternative segments for traffic assignmentAuthor-Name: Xie, Jun," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 406-424.
    6. Hong Zheng & Yi-Chang Chiu & Pitu B. Mirchandani, 2015. "On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems," Transportation Science, INFORMS, vol. 49(1), pages 13-27, February.
    7. Hong Zheng, 2015. "Adaptation of Network Simplex for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 49(3), pages 543-558, August.
    8. Fontaine, Pirmin & Minner, Stefan, 2014. "Benders Decomposition for Discrete–Continuous Linear Bilevel Problems with application to traffic network design," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 163-172.
    9. Kachani, Soulaymane & Perakis, Georgia, 2006. "Fluid dynamics models and their applications in transportation and pricing," European Journal of Operational Research, Elsevier, vol. 170(2), pages 496-517, April.
    10. Pirmin Fontaine & Stefan Minner, 2017. "A dynamic discrete network design problem for maintenance planning in traffic networks," Annals of Operations Research, Springer, vol. 253(2), pages 757-772, June.
    11. Poon, M. H. & Wong, S. C. & Tong, C. O., 2004. "A dynamic schedule-based model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 38(4), pages 343-368, May.
    12. Xie, Chi & Travis Waller, S., 2012. "Stochastic traffic assignment, Lagrangian dual, and unconstrained convex optimization," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1023-1042.
    13. 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.
    14. Han, S. & Heydecker, B.G., 2006. "Consistent objectives and solution of dynamic user equilibrium models," Transportation Research Part B: Methodological, Elsevier, vol. 40(1), pages 16-34, January.
    15. Lo, Hong K. & Szeto, W. Y., 2002. "A cell-based variational inequality formulation of the dynamic user optimal assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 36(5), pages 421-443, June.
    16. Hoang, Nam H. & Vu, Hai L. & Panda, Manoj & Lo, Hong K., 2019. "A linear framework for dynamic user equilibrium traffic assignment in a single origin-destination capacitated network," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 329-352.
    17. Florian, Michael, 1976. "Urban Travel Demand Models and Multi-Modal Traffic Equilibrium," Transportation Research Forum Proceedings 1970s 318523, Transportation Research Forum.
    18. David Boyce, 2007. "Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models," Networks and Spatial Economics, Springer, vol. 7(2), pages 99-128, June.

    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:transp:v:33:y:2006:i:6:p:589-604. 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.