Abstract We consider a dynamic traffic assignment problem in which congestion is modeled explicitly. It has been shown previously that the piecewise linearized problem can be solved by a sequence of linear programs. However, for the dynamic control of traffic networks, the dimensions of the resulting problems are likely to be prohibitive. Since the linear programs have the staircase structure, we propose to apply nested decomposition algorithms. The approach becomes particularly attractive with the advent of computers with multiple processors as the subproblems can be solved concurrently. In this paper, we demonstrate this application on an Intel iPSC/2 hypercube computer.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Solving the dynamic traffic assignment problem on a hypercube multicomputer


    Beteiligte:
    Ho, James K. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    01.01.1990


    Format / Umfang :

    9 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Solving the Multiclass Percentile User Equilibrium Traffic Assignment Problem

    Wu, Xing / Nie, Yu (Marco) | Transportation Research Record | 2013




    Dynamic Traffic Assignment

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