A comparative study of vehicles’ routing algorithms for route planning in smart cities

Vehicle routing problem (VRP) is a generic name referring to optimization problems in transportation, distribution and logistics industry. They mainly focus on serving a number of customers by a number of vehicles. Route planning techniques is one of the main tasks of VRP which aims to find an optimal route from a starting point to a destination on a road map. As road traffic conditions may change during the car journey (e.g., increase/decrease of the congestion level, road incidents etc), the optimal route should be re-evaluated as soon as an update in traffic conditions is available. Choosing an appropriate route planning algorithm among the existing algorithms in the literature to apply it in real road networks is an important task for any transportation application. In this paper, we first present a classification of the different route planning algorithms, and then explain how we compare and analyze their performance when they are applied in real road networks. For the purpose of comparison, we simulate the behavior of these algorithms during runtime using Simulation of Urban Mobility (SUMO) package and TRACI. We have chosen Dijkstra, the most wellknown shortest path algorithm, to be the first algorithm to be implemented in SUMO. Upon reception of any traffic conditions update that affects the current optimal route of a car, we use TRACI to re-apply the algorithm and change this cars route accordingly. In the near future, our target is to simulate other algorithms and compare their performance based on the quality of the obtained best route.