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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    On decentralized dynamic routing for congested traffic networks


    Additional title:

    Dezentrale dynamische Verkehrsfuehrung bei ueberfuellten Wegsystemen


    Contributors:

    Published in:

    Publication date :

    1982


    Size :

    6 Seiten, 5 Bilder, 13 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Dynamic Traffic Assignment in Congested Networks

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


    A decentralized routing control strategy for semi-congested highways

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


    Real-time decentralized traffic signal control for congested urban networks considering queue spillbacks

    Noaeen, Mohammad / Mohajerpoor, Reza / H. Far, Behrouz et al. | Elsevier | 2021


    Dynamic user optimal traffic assignment on congested multidestination networks

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


    The Freight Train Routing Problem for Congested Railway Networks with Mixed Traffic

    Borndörfer, Ralf / Klug, Torsten / Schlechte, Thomas et al. | British Library Online Contents | 2016