Abstract
Classical traffic flow theory was broadly separated into two branches: fluid-dynamical approach and and car-following micromodelling, and most important and difficult problems are network modelling of traffic flow. There exist many works of experimental and computer simulation types, but exact results fot saturated traffic flow on networks are appeared not often. We consider a movement of particles on network of special type as a set of contours with a common node. In 2009 we introduced a flower as network type for transport model, where the dynamical system defined by a system of differential equations on flower was developed. In this paper we study, for the system of connected contours, problem of search the conditions, such that the system becomes synergy mode independence on initial particles configuration at finite time, i.e. all particles move without delay for next time. It is proved, besides all the other results, that the search of synergy conditions is reduced to the investigation of the existence of solutions of linear Diophantine equations with two variables.
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
Similar content being viewed by others
References
Greenshields, B.D., et al:. The photographic method of studying traffic behavior. In: Proceedings of the US Highway Research Board, vol. 13 (1934)
Lighthill, M.J., Whitham, G.B.: On kinematic waves: II. Theory of traffic flow on long crowded roads. Proc. R. Soc. Lond. Ser. A 229, 281–345 (1955)
Drew, D.R.: Traffic Flow Theory and Control, 467 pp. McGraw-Hill, New York (1968)
Nagel, K., Schreckenberg, M.: A cellular automation model for freeway traffic. J. Phys. I. 2, 2221–2229 (1992)
Nagel, K.: Particle hopping models and traffic flow theory. Phys. Rev. E. 53(5), 4655 (1996)
Blank, M. L.: Exact analysis of dynamical systems arising in models of traffic flow. Russ. Math. Surv. 55(3), 167–168. http://dx.doi.org/10.1070/RM2000v055n03ABEH000295 (2000)
Blank, M.L.: Ergodic properties of a simple deterministic traffic flow model. J. Stat. Phys. 111(3–4), 903–930 (2003)
Buslaev, A.P., Yashina, M.V.: About flows on a traffic flower with control. In: The World Congress in Computer Science, Computer, Engineering and Applied Computing (WORLDCOMP’09), LAS Vegas, Nevada USA (July 13–16, 2009) in Proceedings of the 2009 International Conference on Modelling, Simulation and Visualization (MSV’09). Arabnia, H.R., Deligiannidis, L. (eds.) CSREAS Press, pp. 254–257 (2009)
Buslaev, A.P.: Traffic flower with n petals. J. Appl. Funct. Anal. (JAFA) 5(1), 85–99 (2010)
Sierpinski, W.F.: On solution of equations in integer numbers. Publ. Inostr. Lit., Moscow (1961) (In Russian) (O rozwiazywaniu rownan w liczbach calkowitych, 1956)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Buslaev, A.P., Tatashev, A.G., Yashina, M.V. (2016). About Synergy of Flows on Flower. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Dependability Engineering and Complex Systems. DepCoS-RELCOMEX 2016. Advances in Intelligent Systems and Computing, vol 470. Springer, Cham. https://doi.org/10.1007/978-3-319-39639-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-39639-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39638-5
Online ISBN: 978-3-319-39639-2
eBook Packages: EngineeringEngineering (R0)