Investigação de algoritmos para o controle de cruzamentos em redes de transporte

Abstract

Traffic management is nowadays a major relevant subject in the context of smart cities and an important issue is efficient intersection control. Different techniques can be used to deal with intersection control in transport networks, aiming to improve service and minimize the emission of pollutants. In this work, we evaluate different intersections control algorithms in a transportation network with multiple intersections. The algorithms in question are classified into two distinct groups: platoon-oriented, to provide efficiency in terms of throughput, and individual choices-oriented, aiming fairness and focused on minimizing waiting time. The algorithms were evaluated with the support of computer simulation, using the SUMO (Simulation of Urban MObility), a simulator specific to transportation networks. Metrics used for evaluation include throughput and pollutant emissions. It was observed that efficient algorithms flow also give smaller values for the emissions pollutants.