Performance comparison of dynamic vehicle routing methods for minimizing the global dwell time in upcoming smart cities

TL;DR

This paper compares dynamic vehicle routing methods in smart cities to reduce vehicle dwell time, demonstrating that bottleneck-aware routing significantly improves travel times, with a new method further enhancing performance.

Contribution

It introduces and evaluates a new bottleneck-aware routing method that outperforms existing approaches in urban traffic management simulations.

Findings

Bottleneck-aware routing reduces average travel time by 23%.

The new routing method further decreases travel time by 10%.

Dynamic lanes often shift congestion without reducing overall travel times.

Abstract

Traffic jams in urban scenarios are often caused by bottlenecks related to the street topology and road infrastructure, e.g. traffic lights and merging of lanes. Instead of addressing traffic flow optimization in a static way by extending the road capacity through constructing additional streets, upcoming smart cities will exploit the availability of modern communication technologies to dynamically change the mobility behavior of individual vehicles. The underlying overall goal is to minimize the total dwell time of the vehicles within the road network. In this paper, different bottleneck-aware methods for dynamic vehicle routing are compared in comprehensive simulations. As a realistic evaluation scenario, the inner city of Dusseldorf is modeled and the mobility behavior of the cars is represented based on real-world traffic flow data. The simulation results show, that the consideration of bottlenecks in a routing method decreased the average travel time by around 23%. Based on these results a new routing method is created which further reduces the average travel time by around 10%. The simulations further show, that the implementation of dynamic lanes in inner cities most of the time only shift traffic congestion to following bottlenecks without reducing the travel times.