Effects of Route Randomization on Urban Emissions

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.

Publisher

TIB Open Publishing

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篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3