Comprehensive performance analysis and comparison of vehicles routing algorithms in smart cities

Abstract

Abstract-Due to the severe impact of road traffic congestion on both economy and environment, several vehicles routing algorithms have been proposed to optimize travelers itinerary based on real-time traffic feeds or historical data. However, their evaluation methodologies are not as compelling as their key design idea because none of them had been tested under both real transportation map and real traffic data. In this paper, we conduct a deep performance analysis and comparison of four typical vehicles routing algorithms under various scalability levels (i.e. trip length and traffic load) based on realistic transportation simulation. The ultimate goal of this work is to suggest the most suitable routing algorithm to use in different transportation scenarios, so that it can provide a valuable reference for both traffic managers and researchers when they deploy or optimize a large scale centralized Traffic Management System (TMS). The obtained simulation results reveal that dynamic A* is the best routing algorithm if the TMS has sufficient memory or storage capacities, otherwise static A* is also a great alternative.

Next Road Rerouting: A Multiagent System for Mitigating Unexpected Urban Traffic Congestion

“…The static optimal route suggested by VNS is usually very close to the exact fastest route computed by dynamic A * [6] with considerable computational and storage cost [19], but still easily achieved within the time frame of traversing one or more road segment.…”

“…However, VNS calculate a route once, and do not consider sudden changes of the traffic along the suggested route. Even though some solutions [6], [7] can provide a route with a guaranteed minimum travel time using massive historical traffic data and prediction models, their low execution efficiency [19] makes them impractical in large-scale urban scenarios. Additionally, the update of traffic information used in VNS has low frequency (2 mins or more) and limited coverage (only the major roads in a city).…”

VANETs signal quality-based route selection in smart cities

“…), the PSS calculates the fastest possible path P CD_MIN with the duration t CD_MIN . Based on the comparative study of route selection algorithms provided in [18], dynamic A* algorithm [19] can be used for selecting the fastest route. The route with the travel time t CD_MIN is then sent back to the vehicle.…”

A SUMO based evaluation of road incidents' impact on traffic congestion level in smart cities

“…The best route selection criteria and algorithm evaluation metrics are discussed, to identify the most appropriate route parameters to consider, such as travel distance, travel time, the ease of driving and the travel cost. A simulation based comparison of the above routing algorithms has been performed in [18] wherein the authors presented extensive simulation results using a real traffic data from TAPASCologne project.…”