Abstract
Large scale routing strategies require many data, and high computational power if the basic information unit is small. This paper checks the effects of a routing strategy based on aggregated information, the average speed, of a subnetwork. In a grid-network this routing is compared with shortest-distance routing, and data-demanding shortest-time routing. Contrary to the fixed routing, the proposed average-speed routing algorithm can avoid congestion quite long time, and it still needs very few data. Furthermore, it is less sensitive to fluctuations than the control based on speeds on all links. This is a good starting point for further control based on the macroscopic fundamental diagram.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. Kotsialos, M. Papageorgiou, H. Haj-Salem, S. Manfrendi, J. Van Schuppen, J. Taylor, M. Westerman, Co-ordinated Control Strategies. Tech. rep., DACCORD – Development and Application of Co-ordinated Control of Corridors (1997)
V. Dinopoulou, D. C., P. M., European Journal of Operational Research 175(3), 1652 (2006)
N. Geroliminis, C.F. Daganzo, Transportation Research Part B: Methodological 42(9), 759 (2008)
C. Buisson, C. Ladier, Tranportation Research Records, Journal of the Transportation Research Board (2009)
M. Cassidy, K. Jang, C. Daganzo, in Proceedings of the 90th Annual Meeting of the Transportation Research Board (2011)
V. Gayah, C. Daganzo, Transportation Research Part B (2011)
N. Geroliminis, Y. Ji, in Proceedings of 90th Annual Meeting of the Transportation Research Board (2011)
M.J. Lighthill, G.B. Whitham, Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences 229(1178), 317 (1955)
P.I. Richards, Operations Research 4 4, 42 (1956)
S.K. Godunov, Math. Sb. 47, 271 (1959)
J.P. Lebacque, in Proceedings of the 13th International Symposium on Transportation and Traffic Theory (1996)
W.L. Jin, H.M. Zhang, Transportation Research Part B: Methodological 37(6), 521 (2003)
C. Tampère, R. Corthout, D. Cattrysse, L. Immers, Transportation Research Part B 45, 289 (2011)
C. Daganzo, Multinomial Probit: The Theory and its Application to Demand Forecasting (Academic Press, New York, United States, 1979)
Y. Sheffi, Urban transportation networks: Equilibrium analysis with mathematical programming methods (Prentice-Hall, Englewood Cliffs, New Jersey, 1985)
A. Mazloumian, N. Geroliminis, D. Helbing, Philosophical Transactions of the Royal Society A 368, 4627 (2010)
V.L. Knoop, S.P. Hoogendoorn, Proceedings of Traffic and Grannular Flow 2011 (in print), chap. Two-Variable Macropscopic Fundamental Diagrams for Traffic Networks
V.L. Knoop, J.W.C. Van Lint, S.P. Hoogendoorn, in Proceedings of 2nd International Workshop on Traffic Data Collection & its Standardisation (2011)
Acknowledgements
This research was sponsored by a IP-CC subsidy from ICTregie/NWO in the project SI4MS, Sensor Intelligence for Mobility Systems, and by the foundation Next Generation Infrastructures in the project JAMS, Joint Approach for Multi-level Simulation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knoop, V.L., van Lint, H., Hoogendoorn, S.P. (2013). Route Advice Based on Subnetwork Properties. In: Kozlov, V., Buslaev, A., Bugaev, A., Yashina, M., Schadschneider, A., Schreckenberg, M. (eds) Traffic and Granular Flow '11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39669-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-39669-4_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39668-7
Online ISBN: 978-3-642-39669-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)