A hierarchical routing system, using ABC (Ant Based Control) and Dijkstra algorithms, is presented as a part of an Urban Traffic Advisory System. The vehicle routing strategy has to ensure an optimum utilization of the capacities offered by the existing main streets, to equalize the flow on these streets during the peak hours and, combined with the control algorithms, to maintain the traffic fluidity. The mobile telephones can be used to demand and receive information about the best route optimized not only for distance, but also for the shortest drive time the current traffic conditions allow. Because the size of the network is a limiting factor both for ABC and Dijkstra algorithm, a hierarchy was introduced. Then a vehicle will first be routed via the main roads and when it gets in the neighborhood of a specified sector, the routing is done using the smaller corresponding network. A separate thread is created to calculate the minimum distance for each sector belonging to the main route. This way the routing algorithms are more effective.
Hierarchical routing system embedded in an urban driving advisory system
Hierarchische Weg- und Zeitoptimierung für den Stadtverkehr
2005
6 Seiten, 3 Bilder, 2 Tabellen, 5 Quellen
Aufsatz (Konferenz)
Englisch
Energy saving driving advisory system for railway vehicle
Europäisches Patentamt | 2020
|Safety evaluation of drowsy driving advisory system: Alabama case study
Elsevier | 2020
|NTIS | 1977
|