Recent researches have indicated the viability of path-based algorithms for traffic assignment problem and much attention has been received by gradient projection (GP) algorithm. However, the GP algorithm experiences problems near optimal point when trying to obtain high accurate results. To improve its performance near optimal point, this study employs bisection method to find the Curry's steplength of each iteration as so to achieve that goal. A numerical example is provided to demonstrate the advantage of the GP algorithm using Curry's steplength.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Gradient Projection Algorithm Using Curry's Steplength for Traffic Assignment


    Beteiligte:
    Li, Zichuan (Autor:in) / Chang, Gang-Len (Autor:in) / Natarajan, Suhasini (Autor:in)


    Erscheinungsdatum :

    01.10.2008


    Format / Umfang :

    749251 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Gradient Projection Algorithm for Side-constrained Traffic Assignment

    Joseph N. Prashker / Tomer Toledo | DOAJ | 2004

    Freier Zugriff

    Gradient Projection Method for Simulation-Based Dynamic Traffic Assignment

    Yang, Inchul / Jayakrishnan, R. | Transportation Research Record | 2012



    Steplength algorithms for numerical optimization using descent methods

    Borchard, Douglas C. / Kraft, Dieter | TIBKAT | 1980


    Reduced gradient algorithm for user equilibrium traffic assignment problem

    Babazadeh, Abbas / Javani, Babak / Gentile, Guido et al. | Taylor & Francis Verlag | 2020