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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    2019-09-01


    Size :

    1343862 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Solving QoS Limit and Routing by Extended Dijkstra Algorithms

    Junjian, C. / Layuan, L. | British Library Online Contents | 2004


    Analysis Urban Traffic Vehicle Routing Based on Dijkstra Algorithm Optimization

    Ngo, Truong-Giang / Dao, Thi-Kien / Thandapani, Jothiswaran et al. | Springer Verlag | 2021


    Smart-Routing Web App: A Road Traffic Eco-Routing Tool Proposal for Smart Cities

    Lozano-Pinilla, José R. / Sánchez-Cordero, Iván / Vicente-Chicote, Cristina | Springer Verlag | 2023


    RENE DIJKSTRA CE-INSPECTOR

    Online Contents | 2006