The paper presents two approaches for analyzing the route and departure time choice decisions, and the time varying traffic flow patterns in any network form. The first approach uses the framework of existing dynamic assignment models and therefore consists of a macroscopic traffic flow simulation model and a demand adjustment mechanism. In the second approach, dynamic assignment is formulated as an optimization program the solution of which is proved to be unique and equivalent to the dynamic equilibrium conditions. The analysis indicates that in highly congested networks, the application of static assignment models results in travel times which are lower than those predicted by the dynamic assignment procedures.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Two Models for Predicting Dynamic Stochastic Equilibria in Urban Transportation Networks

    Vythoulkas, P. C. | British Library Conference Proceedings | 1990


    Computing dynamic user equilibria for large-scale transportation networks

    Jeihani, Mansoureh / Sherali, Hanif D. / Hobeika, Antoine G. | Online Contents | 2006


    Computing dynamic user equilibria for large-scale transportation networks

    Jeihani, Mansoureh / Sherali, Hanif D. / Hobeika, Antoine G. | Online Contents | 2006


    Stochastic Multi-Vehicle Assignment To Urban Transportation Networks

    Cantarella, Giulio E. / Di Febbraro, Angela / Gangi, Massimo Di et al. | IEEE | 2019


    Stochastic Assignment to Transportation Networks: Models and Algorithms

    Cantarella, Giulio Erberto / Cascetta, Ennio | Springer Verlag | 1998