On decentralized dynamic routing for congested traffic networks

DOI10.1109/TAC.1982.1103104MaRDI QIDQ3970140zbMATH OpenOpenAlexFDO

Authors

Publication date 1982

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.1982.1103104

zbMATH Keywords

congestion clearingdecentralized controldynamical optimal control problemfeedback routing strategyHamilton-Jacobi-Theoryheuristic procedurequeueing networksingle destination networkstraffic control

Mathematics Subject Classification ID

Hamilton-Jacobi theories (49L99) Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Circuits, networks (94C99)

Cited in

(5)

• Fenchel duality and smoothness of solution of the optimal routing problem
• Automatic control methods applied to freeway network traffic
• A survey of Markov decision models for control of networks of queues
• Dynamic traffic assignment: Considerations on some deterministic modelling approaches
• Hierarchical optimal control of urban traffic networks

This page was built for publication: On decentralized dynamic routing for congested traffic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970140)