| Abstract |
Today’s road networks are highly complex and dynamic. This is largely because they must support the needs of an ever-growing population, while also taking into account a variety of safety considerations. As such, these road networks require complex routing algorithms to ensure that vehicles can efficiently and smoothly travel from origin to destination. Moreover, vehicle pollution is a growing problem in many cities around the world. In order to combat this, many cities are now routing vehicles in an effort to reduce emissions. This process involves re-routing vehicles away from heavily populated areas and onto less traveled roads. By doing this, cities are able to reduce the amount of vehicle pollution that enters the atmosphere. In this paper, we will explore the challenges of routing and re-routing road vehicles, introducing and implementing a priority based constrained routing algorithm for road vehicles where priorities will be assigned both statically and dynamically following certain criteria. The results of our routing algorithm will be benchmarked against the most commonly used shortest-path routing algorithm, where we will be able to evaluate the impact of our algorithm on pollution and vehicle’s time spent on traffic. Quantitative results that are both computed and generated by the simulation, alongside with different scenarios will be analysed which will help us understand the necessity of having such algorithm for routing road vehicles. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG. |
