In this paper we will present a dynamic strategic traffic routing algorithm to optimize for minimum travel time and energy consumption in urban traffic. To achieve a global optimization of all current and planned vehicle routes the algorithm works with the data fusion of real-time traffic information and an individual potential function of the road segments. With this algorithm it is possible to route all the vehicles time- or fuel-efficient and minimize the interaction of the different routes of the vehicles. So it is possible to distribute the traffic requests on alternative routes and that travel time and fuel consumption of all vehicles can be globally minimized. Finally, in realistic traffic scenarios it will be demonstrated that huge savings are possible using connected intelligent routing of vehicles as compared to local vehicle navigation.
Strategic dynamic traffic routing algorithm for globally optimized urban traffic
2013-06-01
1312199 byte
Conference paper
Electronic Resource
English
STRATEGIC DYNAMIC TRAFFIC ROUTING ALGORITHM FOR GLOBALLY OPTIMIZED URBAN TRAFFIC
British Library Conference Proceedings | 2013
|Optimal Routing of urban traffic
TIBKAT | 1965
|Analysis Urban Traffic Vehicle Routing Based on Dijkstra Algorithm Optimization
Springer Verlag | 2021
|