A gradient projection method is presented to solve the problem with dynamic traffic assignment. The gradient projection scheme is a feasible direction algorithm that operates directly in the space of path flows. The algorithm was applied to a simulation-based model for dynamic traffic assignment that used microscopic simulation for supply-side modeling. The formulation used link cost functions that were separate for moving and queuing vehicles on each link, so that the formulation could effectively capture the effects of traffic dynamic characteristics on each group, especially in arterial networks. The model and solution algorithm were applied to a small real-world network, and the performance was studied. The gradient projection algorithm avoided the problem of convergence to nonoptimal conditions shown by the prevalent method of successive averages and demonstrated significantly faster convergence.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Gradient Projection Method for Simulation-Based Dynamic Traffic Assignment


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2012-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Gradient Projection Algorithm for Side-constrained Traffic Assignment

    Joseph N. Prashker / Tomer Toledo | DOAJ | 2004

    Free access

    Gradient Projection Algorithm Using Curry's Steplength for Traffic Assignment

    Li, Zichuan / Chang, Gang-Len / Natarajan, Suhasini | IEEE | 2008


    Dynamic Traffic Assignment Based on Macroscopic Simulation

    Autenrieth, T. / ITS Congress Association | British Library Conference Proceedings | 2000


    Demand Simulation for Dynamic Traffic Assignment

    Antoniou, C. / Ben-Akiva, M. / Bierlaire, M. et al. | British Library Conference Proceedings | 1997