This article formulates a discrete-time dynamic traffic assignment (DTA) model and, under certain conditions, shows the existence and uniqueness of network equilibrium. Several theoretical issues need to be tackled. The inflow to a link in a particular discrete (time) period does not necessarily exit within the same period. We consider how flow is passed from one link and period to the next, and the corresponding costs. Under the proposed model, flow departing within a discrete period may experience different link travel times in different discrete periods, even if the flow chooses a single route. Route travel time must then be defined so that route and OD costs are meaningful. To this end, quasi-real route travel time is defined. Based on this definition, a quasi-equilibrium condition for DTA is proposed; a semi-dynamic analogue of user equilibrium. The existence and uniqueness of this equilibrium solution are proven.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A quasi-dynamic assignment model that guarantees unique network equilibrium


    Contributors:

    Published in:

    Publication date :

    2014-08-09


    Size :

    24 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Quasi-Continuous Dynamic Traffic Assignment Model

    Janson, Bruce N. | Online Contents | 1995


    Parallel dynamic traffic equilibrium assignment

    Smith, M.J. | Online Contents | 1993


    Large Problems of Dynamic Network Assignment and Traffic Equilibrium

    Leurent, Fabien / Aguiléra, Vincent | Transportation Research Record | 2009



    A practical equilibrium dynamic assignment model for planners

    Gao, S. / Brandon, J. / Rabinowicz, A. | British Library Conference Proceedings | 2007