Modeling a road system using a graph database

Authors: Shibanova D.A., Stroganov Yu.V.
Published in issue: #1(66)/2022
DOI: 10.18698/2541-8009-2022-1-765
Category: Informatics, Computer Engineering and Control | Chapter: System Analysis, Control, and Information Processing, Statistics
Keywords: modeling, traffic, traffic flow, graph database, response time, road map, non-relational databases, queuing system
Published: 18.02.2022

The problem of modeling a traffic flow using a graph database for describing movements is considered. Before modeling, an analysis of existing approaches was carried out, based on which an algorithm was compiled to solve the problem. The paper hypothesizes that the description of the road system can be correctly performed using the NoSQL graph database. For this purpose, the graph database management system Neo4j was chosen. When implementing the solution, experiments were carried out to determine the response time of the graph database to various queries with various data formats. Analysis of the results showed that the initial formation of a graph in graph databases takes a long time. It takes more time to execute such a query than to implement queries of other types (the maximum search time was about 23% of the graph generation time), so the optimal solution to the problem of time costs may be to exclude the stage of preparing the map from the stage of direct modeling.

References

[1] Tsanakas N., Ekström J., Olstam J. Estimating emissions from static traffic models: problems and solutions. J. Adv. Transp., 2020, vol. 2020, art. 5401792. DOI: URL: https://doi.org/10.1155/2020/5401792

[2] Zong F., Zeng M., Zhong W. et al. Hybrid path selection modeling by considering habits and traffic conditions. IEEE Access, 2019, vol. 7, pp. 43781–43794. DOI: https://doi.org/10.1109/ACCESS.2019.2907725

[3] Alam M.J., Habib M.A. Mass evacuation of Halifax, Canada: a dynamic traffic microsimulation modeling approach. Procedia Comput. Sci., 2019, vol. 151, pp. 535–542. DOI: https://doi.org/10.1016/j.procs.2019.04.072

[4] Liu Q., Sun J., Tian Y. et al. Modeling and simulation of overtaking events by heterogeneous non-motorized vehicles on shared roadway segments. Simul. Model. Pract. Theory, 2020, vol. 103, art. 102072. DOI: https://doi.org/10.1016/j.simpat.2020.102072

[5] Zhang S., Ren G., Yang R. Simulation model of speed-density characteristics for mixed bicycle flow-Comparison between cellular automata model and gas dynamics model. Physica A, 2013, vol. 392, no. 20, pp. 5110–5118. DOI: https://doi.org/10.1016/j.physa.2013.06.019

[6] Khan S.I., Maini P. Modeling heterogeneous traffic flow. Transp. Res. Rec., 1999, vol. 1678, no. 1, pp. 234–241. DOI: https://doi.org/10.3141%2F1678-28

[7] Shen J., Qi J., Qiu F. et al. Simulation of road capacity considering the influence of buses. IEEE Access, 2019, vol. 7, pp. 144178–144187. DOI: https://doi.org/10.1109/ACCESS.2019.2942524

[8] Scifo E. Intoducing Neomap, a Neo4j Desktop application for spatial data. medium.com: website. URL: https://medium.com/neo4j/introducing-neomap-a-neo4j-desktop-application-for-spatial-data-3e14aad59db2 (accessed: 16.03.2020).

[9] Scifo E. Visualizing shortest paths with neomap ≥ 0.4.0 and the Neo4j Graph Data Science plugin. medium.com: website. URL: https://medium.com/neo4j/visualizing-shortest-paths-with-neomap-0-4-0-and-the-neo4j-graph-data-science-plugin-18db92f680de (accessed: 16.03.2020).

[10] Krestov S.G., Stroganov Yu.V. Test on processing time of generated enquiry to the graph data. Novye informatsionnye tekhnologii v avtomatizirovannykh sistemakh, 2017, no. 20, pp. 235–238 (in Russ.).