Abstract This paper is concerned with the modelling of the Dynamic Traffic Assignment Problem for predicting the flows of urban transportation networks, mainly at peak periods. We descibe one Dynamic Traffic Assignment Model that is mainly based on the assumption that the time spent by a vehicle on a link may be decomposed into a fixed travel time, plus a waiting time spent in an exit queue which resides on the same link. This model leads to a network structure that is a temporal expansion of the base network including the queues. Therefore, this Dynamic Traffic Assignment Model may be viewed as a classical Static one over the expanded network. Then we describe a second approach that is mainly based on the assumption that the users know at each period of time, the travel times on the links of the network, but not for the next periods, and that, at each node, they enter their actual shortest path. Numerical tests have been performed with the transportation network of the city of Hull (Canada).


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Traffic Models for Dynamic Assignment

    Addison, J. D. / Heydecker, B. G. | British Library Conference Proceedings | 1992


    Traffic models for dynamic assignment

    Addison, J. D. / Heydecker, B. G. / Universities Transport Study Group | British Library Conference Proceedings | 1992


    Analysis of Traffic Models for Dynamic Equilibrium Traffic Assignment

    Heydecker, B. G. / Addison, J. D. / Association of European Operational Research Societies | British Library Conference Proceedings | 1998


    Subnetwork Analysis for Dynamic Traffic Assignment Models

    Gemar, Mason D. / Bringardner, Jack W. / Boyles, Stephen D. et al. | Transportation Research Record | 2014


    Dynamic Traffic Assignment

    De Romph, E. | British Library Conference Proceedings | 1996