Навчально-методичні матеріали
Постійне посилання зібрання
Переглянути
Перегляд Навчально-методичні матеріали за Ключові слова "A-star algorithm"
Зараз показуємо 1 - 1 з 1
Результатів на сторінці
Налаштування сортування
- ДокументRouting of vehicle time-optimal city traffic dynamic path(Харків: Харківський національний університет імені В.Н.Каразіна, 2023) Nikolyuk, P. K.; Ніколюк, П. К.The key goal of this study is to synchronize traffic flows, optimize the use of the transport arteries throughout the city, prevent congestion, and follow each vehicle to its destination to minimize time spent on the trip. As a result, the total time spent by cars on the road will be significantly reduced, and environmental conditions will improve accordingly. The object of the study is a city's transportation network, represented as a weighted oriented nonplanar multigraph (WONM). The key advantage of using the graph theory to build optimal routes is based on the following considerations: 1) the graph theory has developed many algorithms for finding optimal routes (Dijkstra algorithm, Floyd-Warshall algorithm, A-star algorithm, etc.); 2) the graph theory is used as the theoretical and practical basis of logistical systems, including urban traffic. To build a route in such a multigraph an A-star algorithm has been used, which establishes an optimal time (t-optimal) route between two selected vertices of graph.