Skip to main content
SpringerLink
Log in

System optimal and user equilibrium time-dependent traffic assignment in congested networks

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper formulates two dynamic network traffic assignment models in which O-D desires for the planning horizon are assumed known a priori: the system optimal (SO) and the user equilibrium (UE) time-dependent traffic assignment formulations. Solution algorithms developed and implemented for these models incorporate a traffic simulation model within an overall iterative search framework. Experiments conducted on a test network provide the basis for a comparative analysis of system performance under the SO and UE models.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Carey, Optimal time varying flows on congested networks, Operations Research 35(1987)58–69.

    Google Scholar 

  2. M. Carey, Nonconvexity of the dynamic assignment problem, Transportation Research 26B(1992)127–133.

    Google Scholar 

  3. C.S. Fisk and D.E. Boyce, Alternative variational inequality formulations of the network equilibrium-travel choice problem, Transportation Science 17(1983)454–463.

    Google Scholar 

  4. T.L. Friesz, D. Bernstein, T.E. Smith, R.L. Tobin and B.W. Wie, A variational inequality formulation of the dynamic network user equilibrium problem, Operations Research 41(1993)179–191.

    Google Scholar 

  5. M.O. Ghali and M.J. Smith, Optimal dynamic traffic assignment of a congested city network,Proc. of the 2nd Int. Seminar on Urban Traffic Networks, Capri, Italy (July 1992).

    Google Scholar 

  6. M.O. Ghali and M.J. Smith, Traffic assignment, traffic control and road pricing, presented at the12th Int. Symp. on Transportation and Traffic Theory, Berkeley, CA (July 1993).

  7. B.N. Janson, Dynamic traffic assignment for urban road networks, Transportation Research 25B(1991)143–161.

    Google Scholar 

  8. R. Jayakrishnan, H.S. Mahmassani and T. Hu, An evaluation tool for advanced traffic information and management systems in urban networks, Transportation Research 2C(1994)129–147.

    Google Scholar 

  9. H.S. Mahmassani, T. Hu, S. Peeta and A. Ziliaskopoulos, Development and testing of dynamic traffic assignment and simulation procedures for ATIS/ATMS applications, Technical Report DTFH61-90-C-00074-FG, Center for Transportation Research, The University of Texas at Austin (1994).

  10. H.S. Mahmassani and S. Peeta, System optimal dynamic assignment for electronic route guidance in a congested traffic network,Proc. of the 2nd Int. Seminar on Urban Traffic Networks, Capri, Italy (1992).

    Google Scholar 

  11. H.S. Mahmassani and S. Peeta, Network performance under system optimal and user equilibrium dynamic assignments: Implications for ATIS, Transportation Research Record 1408 (1993)83–93.

    Google Scholar 

  12. H.S. Mahmassani, S. Peeta, T. Hu and A. Ziliaskopoulos, Dynamic traffic assignment with multiple user classes for real-time ATIS/ATMS applications,Proc. of the ATMS Conf. on Management of Large Urban Traffic Systems, St. Petersburg, Florida (1993).

  13. S. Peeta, System optimal dynamic traffic assignment in congested networks with advanced information systems, Ph.D. Dissertation, The University of Texas at Austin (1994).

  14. S. Peeta and H.S. Mahmassani, Multiple user classes real-time traffic assignment for on-line operations: A rolling horizon solution framework, Transportation Research 3C(1995)83–98.

    Google Scholar 

  15. B. Ran, D.E. Boyce and L.J. LeBlanc, A new class of instantaneous dynamic user-optimal traffic assignment models, Operations Research 41(1993).

  16. M.J. Smith, A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks, presented at the71st Annual Meeting of TRB, Washington DC (1991).

  17. J.G. Wardrop, Some theoretical aspects of road traffic research, Proceedings Institution of Civil Engineers II(1) (1952) 325–378.

    Google Scholar 

  18. A. Ziliaskopoulos and H.S. Mahmassani, Design and implementation of a shortest path algorithm with time-dependent arc costs,Proc. of the 5th Advanced Technology Conference, Washington DC (1992) pp. 1072–1093.

  19. A. Ziliaskopoulos and H.S. Mahmassani, A time-dependent shortest path algorithm for real-time intelligent vehicle/highway systems applications”, Transportation Research Record 1408 (1993)94–100.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Civil Engineering, Purdue University, 47907-1248, West Lafayette, IN, USA

    Srinivas Peeta

  2. Center for Transportation Research, The University of Texas at Austin, 78712, Austin, TX, USA

    Hani S. Mahmassani

Authors
  1. Srinivas Peeta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hani S. Mahmassani
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peeta, S., Mahmassani, H.S. System optimal and user equilibrium time-dependent traffic assignment in congested networks. Ann Oper Res 60, 81–113 (1995). https://doi.org/10.1007/BF02031941

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02031941

Keywords

Search

Navigation