Zobrazit v EDS

An Optimized Route Assignment for Preventing Traffic Jams

Uloženo v:
Podrobná bibliografie
Název: An Optimized Route Assignment for Preventing Traffic Jams
Autoři: Nikica Hlupić, Danko Basch, Edouard Ivanjko, Jakov Prister
Zdroj: IEEE Access, Vol 13, Pp 61207-61224 (2025)
IEEE access
Volume 13
Informace o vydavateli: Institute of Electrical and Electronics Engineers (IEEE), 2025.
Rok vydání: 2025
Témata: TEHNIČKE ZNANOSTI. Računarstvo. Umjetna inteligencija, TECHNICAL SCIENCES. Traffic and Transport Technology. Road and Rail Transport, traffic assignment, TEHNIČKE ZNANOSTI. Tehnologija prometa i transport. Cestovni i željeznički promet, Electrical engineering. Electronics. Nuclear engineering, navigation, optimization, TECHNICAL SCIENCES. Computing. Artificial Intelligence, Navigation, urban area, TK1-9971
Popis: Frequent traffic jams are a common problem in large urban areas and despite real-time operation, contemporary traffic control (i.e., navigation) systems do not fully succeed in solving this problem. This situation motivates traffic assignment research aimed at optimal usage of infrastructure, that is, minimization of travel time. However, achieving this goal in real-time requires a departure from traditional approach and an enhancement of the predictive and preventive abilities of control and navigation systems. To this aim, the paper presents an efficient solution for an optimized route assignment given the set of available routes between two city zones. Unlike other methods, mostly working on link (graph edge) level, the proposed solution works on route (graph path) level and is based on estimation of the expected (average) travel times. This enables the application of two efficient algorithms for optimization of vehicle distribution according to two important criteria, that is, both Wardrop’s principles. The most prominent characteristics of the proposed algorithms are linear complexity with respect to the number of vehicles (traffic flow), linear and quadratic complexity with respect to the number of routes for user equilibrium and system optimization, respectively, simplicity, and absence of any numerical issues, which makes them suitable for real-time traffic management. The theoretical results have been confirmed by diverse evaluations using synthetic models and in a case study using the city of Zagreb as a real world example. The proposed concept is universal, inexpensive, and quickly implementable as an upgrade to the existing traffic control or navigation systems.
Druh dokumentu: Article
Popis souboru: application/pdf
ISSN: 2169-3536
DOI: 10.1109/access.2025.3553492
Přístupová URL adresa: https://doaj.org/article/6e02627c0a0c4aba8f3f837f9d73723a
https://ieeexplore.ieee.org/document/10937031
https://doi.org/10.1109/access.2025.3553492
https://repozitorij.fer.unizg.hr/islandora/object/fer:13394/datastream/FILE0
https://repozitorij.fer.unizg.hr/islandora/object/fer:13394
https://urn.nsk.hr/urn:nbn:hr:168:787103
Rights: CC BY
URL: http://rightsstatements.org/vocab/InC/1.0/
Přístupové číslo: edsair.doi.dedup.....2d6c42a68c26975c37d53d01f2ccab5f
Databáze: OpenAIRE
Popis
Abstrakt:Frequent traffic jams are a common problem in large urban areas and despite real-time operation, contemporary traffic control (i.e., navigation) systems do not fully succeed in solving this problem. This situation motivates traffic assignment research aimed at optimal usage of infrastructure, that is, minimization of travel time. However, achieving this goal in real-time requires a departure from traditional approach and an enhancement of the predictive and preventive abilities of control and navigation systems. To this aim, the paper presents an efficient solution for an optimized route assignment given the set of available routes between two city zones. Unlike other methods, mostly working on link (graph edge) level, the proposed solution works on route (graph path) level and is based on estimation of the expected (average) travel times. This enables the application of two efficient algorithms for optimization of vehicle distribution according to two important criteria, that is, both Wardrop’s principles. The most prominent characteristics of the proposed algorithms are linear complexity with respect to the number of vehicles (traffic flow), linear and quadratic complexity with respect to the number of routes for user equilibrium and system optimization, respectively, simplicity, and absence of any numerical issues, which makes them suitable for real-time traffic management. The theoretical results have been confirmed by diverse evaluations using synthetic models and in a case study using the city of Zagreb as a real world example. The proposed concept is universal, inexpensive, and quickly implementable as an upgrade to the existing traffic control or navigation systems.
ISSN:21693536
DOI:10.1109/access.2025.3553492