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.
System optimal and user equilibrium time-dependent traffic assignment in congested networks
Annals of Operations Research ; 60 , 1 ; 81-113
1995-12-01
33 pages
Article (Journal)
Electronic Resource
English
Dynamic User Equilibrium Traffic Assignment on Congested Multidestination Network
British Library Online Contents | 2004
|Dynamic User Equilibrium Traffic Assignment on Congested Multidestination Network
Online Contents | 2004
|Dynamic Traffic Assignment in Congested Networks
Springer Verlag | 1996
|Dynamic Traffic Assignment in Congested Networks
British Library Conference Proceedings | 1996
|