Abstract A dual decomposition algorithm is developed for large-scale traffic assignment problems. In contrast to standard methods, this algorithm does not require that the system or user optimal objective function be differentiable and it allows bounds on the arc flows. Iterates alternate between dual ascent steps and calculations of shortest paths as in the Frank-Wolfe method. Although a dual method, it produces feasible flow patterns at each iteration. Convergence of the method is proven and a computational example is given.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A dual ascent algorithm for traffic assignment problems


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    01.01.1990


    Format / Umfang :

    8 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    A primal-dual traffic assignment algorithm

    Petersen, E. | Tema Archiv | 1975



    Ascent Problems of Sounding Rockets

    Crabill, N. L. | NTRS | 1961



    Ascent problems of sounding rockets

    Crabill, N.L. | Engineering Index Backfile | 1961