Author:
Cornacchia Giuliano,Nanni Mirco,Pedreschi Dino,Pappalardo Luca
Abstract
Routing algorithms typically suggest the fastest path or slight variation to reach a user's desired destination. Although this suggestion at the individual level is undoubtedly advantageous for the user, from a collective point of view, the aggregation of all single suggested paths may result in an increasing impact (e.g., in terms of emissions).In this study, we use SUMO to simulate the effects of incorporating randomness into routing algorithms on emissions, their distribution, and travel time in the urban area of Milan (Italy). Our results reveal that, given the common practice of routing towards the fastest path, a certain level of randomness in routes reduces emissions and travel time. In other words, the stronger the random component in the routes, the more pronounced the benefits upon a certain threshold. Our research provides insight into the potential advantages of considering collective outcomes in routing decisions and highlights the need to explore further the relationship between route randomization and sustainability in urban transportation.
Reference40 articles.
1. R. Zhu, M. Wong, E. Guilbert, and P. W. Chan, “Understanding heat patterns produced by vehicular flows in urban areas,” Scientific Reports, vol. 7, Nov. 2017, doi: https://www.doi.org/10.1038/s41598-017-15869-6.
2. L. Wu, X. Xiao, D. Deng, G. Cong, A. D. Zhu, and S. Zhou, “Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation,” 2012, doi: https://www.doi.org/10.48550/ARXIV.1201.6564.
3. L. Li, M. Cheema, H. Lu, M. Ali, and A. N. Toosi, “Comparing Alternative Route Planning Techniques: A Comparative User Study on Melbourne, Dhaka and Copenhagen Road Networks,” IEEE Transactions on Knowledge & Data Engineering, vol. 34, no. 11, pp. 5552–5557, Nov. 2022, doi: https://www.doi.org/10.1109/TKDE.2021.3063717.
4. D. Cheng, O. Gkountouna, A. Züfle, D. Pfoser, and C. Wenk, “Shortest-Path Diversification through Network Penalization: A Washington DC Area Case Study,” 2019. doi: https://www.doi.org/10.1145/3357000.3366137.
5. H. Aljazzar and S. Leue, “K ⁎: A heuristic search algorithm for finding the k shortest paths,” Artificial Intelligence - AI, vol. 175, pp. 2129–2154, Dec. 2011, doi: https://www.doi.org/10.1016/j.artint.2011.07.003.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献