DYNAMIC USER OPTIMAL TRAFFIC ASSIGNMENT ON CONGESTED MULTIDESTINATION NETWORKS

An equivalent continuous time optimal control problem is formulated to predict the temporal evolution of traffic flow pattern on a congested multiple origin-destination network, corresponding to a dynamic generalization of Wardropian user equilibrium. Optimality conditions are derived using the Pontryagin minimum principle and given economic interpretations which are generalizations of similar results previously reported for single-destination networks. Analyses of sufficient conditions for optimality and of singular controls are also given. Under the steady-state assumptions, the model is shown to be a proper dynamic extension of Beckmann's mathematical programming problem for a static user equilibrium traffic assignment.

  • Availability:
  • Corporate Authors:

    Pergamon Press, Incorporated

    Headington Hill Hall
    Oxford OX30BW,    
  • Authors:
    • Wie, B-W
    • Friesz, T L
    • Tobin, R L
  • Publication Date: 1990-12

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00615034
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: Sep 30 1992 12:00AM