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.
On decentralized dynamic routing for congested traffic networks
Dezentrale dynamische Verkehrsfuehrung bei ueberfuellten Wegsystemen
IEEE Transactions on Automatic Control ; 27 , 6 ; 1233-1238
1982
6 Seiten, 5 Bilder, 13 Quellen
Article (Journal)
English
Dynamic Traffic Assignment in Congested Networks
British Library Conference Proceedings | 1996
|A decentralized routing control strategy for semi-congested highways
British Library Conference Proceedings | 1997
|The Freight Train Routing Problem for Congested Railway Networks with Mixed Traffic
British Library Online Contents | 2016
|