Digital Twin of Parking Space
Main Article Content
Abstract
Increasing urbanization and motorization lead to a shortage of parking spaces, resulting in congestion, increased emissions, and a declining quality of life. Traditional parking management methods are ineffective in addressing this issue, necessitating the use of data analysis and forecasting tools. This paper examines the use of a digital twin of the Kazan parking system. Data was filtered and integrated, points of interest were clustered, and a correlation analysis of factors influencing parking occupancy was performed. Linear regression, decision tree, random forest, XGBoost, MLP, and LSTM models were trained and compared to predict occupancy levels. The random forest model demonstrated the best results. The developed digital twin prototype enables monitoring and scenario modeling, making it an effective tool for parking space optimization and management decision-making.
Article Details
References
2. Coching J.K. et al. Digital Twinning Mechanism and Building Information Modeling for a Smart Parking Management System // Smart Cities. 2025. Vol. 8. No. 5. P. 146.
3. Zou Y. et al. A Digital Twin prototype for smart parking management // ECPPM 2022-eWork and eBusiness in Architecture, Engineering and Construction 2022. CRC Press, 2023. P. 250–257.
4. Chen W., Wang X., Wu M. Intelligent Parking Service System Design Based on Digital Twin for Old Residential Areas // Electronics. 2024. Vol. 13. No. 23. P. 4597.
5. Open Street Map. URL: https://www.openstreetmap.org/ (last access: 25.08.2025).
6. Gorparkovki Kazan'. Oficial'nyj sajt servisa parkovok . URL: https://parkingkzn.ru/ru/ (last access: 25.08.2025).
7. Aliguliyev R., Tahirzada S.F. Performance comparison of k-means, parallel k-means and k-means++ // Reliability: Theory & Applications. 2025. Vol. 20. No. S7 (83). P. 169–176.
8. Bazilevsky M.P. Reshenie optimizacionnoj zadachi ocenivaniya modelej polnosvyaznoj linejnoj regressii // Modeling and data analysis. 2024. Vol. 14. No. 1. P. 121–134.
9. Pyrnova O.A., Katasev A.S. Postroenie i ocenka effektivnosti modeli dereva reshenij dlya prognozirovaniya uspevaemosti obuchayushchihsya // Engineering Bulletin of the Don. 2024. No. 4 (112). P. 578–584.
10. Utkin L., Konstantinov A. Random survival forests incorporated by the Nadaraya-Watson regression // Informatics and Automation. 2022. Vol. 21. No. 5. P. 851–880.
11. Chen T., Guestrin C. XGBoost: A scalable tree boosting system // Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining. 2016. P. 785–794.
12. Matveeva K.A., Minnikhanov R.N., Katasev A.S. Svertochnaya nejrosetevaya model' akusticheskogo obnaruzheniya avarijno-spasatel'nyh mashin // Bulletin of the Technological University. 2024. Vol. 27. No. 1. P. 76–80.
13. Komartsova L.G., Kadnikov D.S. Issledovanie geneticheskih algoritmov dlya obucheniya mnogoslojnogo perseptrona // Neurocomputers: development, application. 2010. No. 12. P. 12–19.
14. Hochreiter S., Schmidhuber J. Long short-term memory // Neural computation. 1997. Vol. 9. No. 8. P. 1735–1780.
15. Emaletdinova L.Yu., Vildanov N.R., Katasev A.S. Ispol'zovanie nejrosetevoj modeli TCN-LSTM dlya prognozirovaniya znachenij vremennogo ryada // Scientific and Technical Bulletin of the Volga Region. 2023. No. 6. P. 62–64.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Presenting an article for publication in the Russian Digital Libraries Journal (RDLJ), the authors automatically give consent to grant a limited license to use the materials of the Kazan (Volga) Federal University (KFU) (of course, only if the article is accepted for publication). This means that KFU has the right to publish an article in the next issue of the journal (on the website or in printed form), as well as to reprint this article in the archives of RDLJ CDs or to include in a particular information system or database, produced by KFU.
All copyrighted materials are placed in RDLJ with the consent of the authors. In the event that any of the authors have objected to its publication of materials on this site, the material can be removed, subject to notification to the Editor in writing.
Documents published in RDLJ are protected by copyright and all rights are reserved by the authors. Authors independently monitor compliance with their rights to reproduce or translate their papers published in the journal. If the material is published in RDLJ, reprinted with permission by another publisher or translated into another language, a reference to the original publication.
By submitting an article for publication in RDLJ, authors should take into account that the publication on the Internet, on the one hand, provide unique opportunities for access to their content, but on the other hand, are a new form of information exchange in the global information society where authors and publishers is not always provided with protection against unauthorized copying or other use of materials protected by copyright.
RDLJ is copyrighted. When using materials from the log must indicate the URL: index.phtml page = elbib / rus / journal?. Any change, addition or editing of the author's text are not allowed. Copying individual fragments of articles from the journal is allowed for distribute, remix, adapt, and build upon article, even commercially, as long as they credit that article for the original creation.
Request for the right to reproduce or use any of the materials published in RDLJ should be addressed to the Editor-in-Chief A.M. Elizarov at the following address: amelizarov@gmail.com.
The publishers of RDLJ is not responsible for the view, set out in the published opinion articles.
We suggest the authors of articles downloaded from this page, sign it and send it to the journal publisher's address by e-mail scan copyright agreements on the transfer of non-exclusive rights to use the work.