Performance Evaluation of Dijkstra and A* Traffic Routing Algorithms in Smart Cities

As the urban population grew and the dependence on transport increased, several urban problems emerged in the cities, including traffic problems such as traffic congestion, high levels of pollution, increased mobility time and traffic accidents. There are traditional methods solved these problems, such as creat new or expanding existing roads to ease congestion, giving a short-term solution, adversely affecting the environment, and attracting increased traffic for vehicles within cities. In this paper, we conduct performance evaluation and compare two vehicle routing algorithms based on realistic transfer simulations. By doing so, we can identify the best routing algorithm for use in transportation in Kassala city, in order to provide a reference to the management of traffic, researchers and others. The results show that the Dijkstra algorithm is better than A* algorithm based on the evaluation criteria used in the research, namely, mean travel time, mean speed, mean waiting time, and mean CO2 emissions.