Skip to main content
SpringerLink
Log in

A Combinatorial user optimal dynamic traffic assignment algorithm

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

Abstract

This paper introduces a polynomial combinatorial optimization algorithm for the dynamic user optimal problem. The approach can efficiently solve single destination networks and can be potentially extended to heuristically solve multidestinational networks. In the model, traffic is propagated according to sound traffic flow theoretical models rather than link exit functions; thereby allowing link queue evolution to be modeled more precisely. The algorithm is designed, proven, implemented and computationally tested.

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

  • Boyce, D., D.-H. Lee, and B. Janson. (1996). “A Variational Inequality Model of an Ideal Dynamic User-Optimal Route Choice Problem.” Presented at the 4th Meeting of the EURO Working Group on Transportation, Newcastle, UK.

  • Carey, M. (1986). “A Constraint Qualification for a Dynamic Traffic Assignment Model.” Transportation Science 20, 55–88.

    Google Scholar 

  • Carey, M. (1987). “Optimal Time-Varying Flows on Congested Networks.” Operations Research, 35, 58–69.

    Google Scholar 

  • Carey, M. (1992). “Nonconvexity of the Dynamic Traffic Assignment Problem.” Transportation Research, 26B, 127–133.

    MathSciNet  Google Scholar 

  • Daganzo, C. (1994). “The Cell Transmission Model: A Simple Dynamic Representation of Highway Traffic Consistent with the Hydrodynamic Theory.” Transportation Research 28B(4), 269–287.

    Google Scholar 

  • Daganzo, C. (1995). “The Cell Transmission Model, Part II: Network Traffic.” Transportation Research 29B(2), 79–93.

    Google Scholar 

  • Friesz, T., et al. (1989). “Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem.” Operations Research 37, 893–901.

    Google Scholar 

  • Friesz, T., et al. (1993). “A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem.” Operations Research 41, 179–191.

    Google Scholar 

  • Janson, B. (1992). “Dynamic Traffic Assignment for Urban Networks.” Transportation Research 25B, 143–161.

    Google Scholar 

  • Lee, D.-H. (1996). “Formulation and Solution of a Dynamic User-Optimal Route Choice Model on a Large-Scale Traffic Network.” Ph.D. Thesis in Civil Engineering, University of Illinois, Chicago.

  • Merchant, D.K., and G. Nemhauser. (1978a). “A Model and an Algorithm for the Dynamic Traffic Assignment Problem.” Transportation Science 12, 183–199.

    Google Scholar 

  • Merchant, D.K. and G. Nemhauser. (1978b). “Optimality Conditions for a Dynamic Traffic Assignment Model.” Transportation Science, 12 (1978b) 200–207.

    Article  Google Scholar 

  • Sheffi, Y. (1984). Urban Transportation Networks: Equilibirum Analysis with Mathematical Progeamming Methoods. Prentice-Hall, Englewood Cliffs, N.J.

  • Smith, M. (1993). “A New Dynamic Traffic Model and the Existence and Calculation of Dynamic user Equilibria on Congested Capacity-Constrained Road Networks.” Transportation Research 27B, 49–63.

    Google Scholar 

  • Waller, S.T. and A. Ziliaskopoulos. (2001). “A Dynamic and Stochastic Approach to Network Design.” Journal of the Transportation Research Board No. 1771, pp. 106–114.

  • Wie, B.-W. (1995). “Discrete Time, Nested Cost Operator AApproach to the Dynamic Network User Equilibrium Problem.” Transportation Science 28, 79–92.

    Google Scholar 

  • Ziliaskopoulos A. (2001). “A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem.” Transportation Science 34, 37–49.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Civil Engineering, University of Texas at Austin, Austin, TX, 78712, USA

    S. Travis Waller

  2. Department of Civil Engineering, Northwestern University, Evanston, IL, 60208, USA

    Athanasios K. Ziliaskopoulos

Authors
  1. S. Travis Waller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Athanasios K. Ziliaskopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Travis Waller.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Waller, S.T., Ziliaskopoulos, A.K. A Combinatorial user optimal dynamic traffic assignment algorithm. Ann Oper Res 144, 249–261 (2006). https://doi.org/10.1007/s10479-006-0013-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0013-z

Keywords

Search

Navigation