Abstract 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.
Dynamic user optimal traffic assignment on congested multidestination networks
Transportation Research Part B: Methodological ; 24 , 6 ; 431-442
1990-01-01
12 pages
Article (Journal)
Electronic Resource
English
Dynamic User Equilibrium Traffic Assignment on Congested Multidestination Network
Online Contents | 2004
|Dynamic User Equilibrium Traffic Assignment on Congested Multidestination Network
British Library Online Contents | 2004
|Optimal control of multidestination traffic networks
Tema Archive | 1990
|Dynamic Traffic Assignment in Congested Networks
British Library Conference Proceedings | 1996
|Dynamic Traffic Assignment in Congested Networks
Springer Verlag | 1996
|