The problem of routing traffic through single destination congested networks is considered, when the network has deterministic inputs and may contain looping paths. A decentralized dynamic routing strategy is proposed which assures that no traffic is directed around loops.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    On decentralized dynamic routing for congested traffic networks


    Weitere Titelangaben:

    Dezentrale dynamische Verkehrsfuehrung bei ueberfuellten Wegsystemen


    Beteiligte:
    Sarachik, P.E. (Autor:in) / Oezguener, Ue. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1982


    Format / Umfang :

    6 Seiten, 5 Bilder, 13 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    Dynamic Traffic Assignment in Congested Networks

    Bellei, G. / Bielli, M. / Italian National Research Council; Progetto Finalizzato Transporti et al. | British Library Conference Proceedings | 1996


    Dynamic Traffic Assignment in Congested Networks

    Bellei, Giuseppe / Bielli, Maurizio | Springer Verlag | 1996


    A decentralized routing control strategy for semi-congested highways

    Iftar, A. / International Federation of Automatic Control | British Library Conference Proceedings | 1997



    Dynamic user optimal traffic assignment on congested multidestination networks

    Wie, Byung-Wook / Friesz, Terry L. / Tobin, Roger L. | Elsevier | 1990