The Effects of Route Randomization on Urban Emissions
DOI:
https://doi.org/10.52825/scp.v4i.217Keywords:
Routing, Route Randomization, Traffic Simulation, Urban EmissionsAbstract
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.
Downloads
References
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.
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.
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.
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.
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.
J. Y. Yen, “Finding the K Shortest Loopless Paths in a Network,” Management Science, vol. 17, no. 11, pp. 712–716, 1971, doi: https://www.doi.org/10.1287/mnsc.17.11.712.
J. W. Suurballe, “Disjoint paths in a network,” Networks, vol. 4, no. 2, pp. 125–145, 1974, doi: https://doi.org/10.1002/net.3230040204.
T. Chondrogiannis, P. Bouros, J. Gamper, and U. Leser, “Alternative Routing: K-Shortest Paths with Limited Overlap,” 2015. doi: 10.1145/2820783.2820858.
H. Liu, C. Jin, B. Yang, and A. Zhou, “Finding Top-k Shortest Paths with Diversity,” IEEE Transactions on Knowledge and Data Engineering, vol. 30, no. 3, pp. 488–502, 2018, doi: https://www.doi.org/10.1109/TKDE.2017.2773492.
T. Chondrogiannis, P. Bouros, J. Gamper, U. Leser, and D. B. Blumenthal, “Finding K-Dissimilar Paths with Minimum Collective Length,” 2018, pp. 404–407. doi: https://www.doi.org/10.1145/3274895.3274903.
B. Zhou, D. Rybski, and J. Kropp, “The role of city size and urban form in the surface urban heat island,” Scientific Reports, vol. 7, p. 4791, Jul. 2017, doi: 10.1038/s41598-017-04242-2.
M. Barth and K. Boriboonsomsin, “Real-world carbon dioxide impacts of traffic congestion,” Transportation research record, vol. 2058, no. 1, pp. 163–171, 2008.
J. Wardrop, “Some theoretical aspects of road traffic research,” Proceedings of the Institution of Civil Engineers, vol. 1, pp. 325–378, 1952.
C. V. I. T. Ltd., Choice Routing. http://www.camvit.com, 2005. [Online]. Available: http://www.camvit.com
M. Böhm, M. Nanni, and L. Pappalardo, “Gross polluters and vehicle emissions reduction,”Nature Sustainability, vol. 5, no. 8, pp. 699–707, 2022.
C. K. Gately, L. R. Hutyra, and I. Sue Wing, “Cities, traffic, and co2: A multidecadal assessment of trends, drivers, and scaling relationships,” Proceedings of the National Academy of Sciences, vol. 112, no. 16, pp. 4999–5004, 2015, ISSN: 0027-8424. DOI: https://www.doi.org/10.1073/pnas.1421723112. eprint: https://www.pnas.org/content/112/16/4999.full.pdf. [Online]. Available: https://www.pnas.org/content/112/16/4999.
R. Zhu, M. Wong, E. Guilbert, and P. 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.
B. Zhou, D. Rybski, and J. Kropp, “The role of city size and urban form in the surface urban heat island,” Scientific Reports, vol. 7, p. 4791, Jul. 2017. DOI: https://www.doi.org/10.1038/s41598-017-04242-2.
M. Barth and K. Boriboonsomsin, “Real-world carbon dioxide impacts of traffic congestion,” Transportation research record, vol. 2058, no. 1, pp. 163–171, 2008.
G. Cornacchia, M. Böhm, G. Mauro, M. Nanni, D. Pedreschi, and L. Pappalardo, “How routing strategies impact urban emissions,” in Proceedings of the 30th International Conference on Advances in Geographic Information Systems, ser. SIGSPATIAL ’22, Seattle, Washington: Association for Computing Machinery, 2022, ISBN: 9781450395298. DOI: https://www.doi.org/10.1145/3557915.3560977. [Online].
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, ISSN: 1558-2191. DOI: https://www.doi.org/10.1109/TKDE.2021.3063717.
D. Cheng, O. Gkountouna, A. Züfle, D. Pfoser, and C. Wenk, “Shortest-path diversification through network penalization: A washington dc area case study,” in Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science, ser. IWCTS’19, Chicago, IL, USA: Association for Computing Machinery, 2019, ISBN: 9781450369671. DOI: https://www.doi.org/10.1145 / 3357000.3366137. [Online].
H. Liu, C. Jin, B. Yang, and A. Zhou, “Finding top-k shortest paths with diversity,” IEEE Transactions on Knowledge and Data Engineering, vol. 30, no. 3, pp. 488–502, 2018. DOI: https://www.doi.org/10.1109/TKDE.2017.2773492.
T. Chondrogiannis, P. Bouros, J. Gamper, and U. Leser, “Alternative routing: K-shortest paths with limited overlap,” ser. SIGSPATIAL ’15, Seattle, Washington: Association for Computing Machinery, 2015, ISBN: 9781450339674. DOI: https://www.doi.org/10.1145/2820783.2820858. [Online].
T. Chondrogiannis, P. Bouros, J. Gamper, U. Leser, and D. B. Blumenthal, “Finding kdissimilar paths with minimum collective length,” ser. SIGSPATIAL ’18, Seattle, Washington: Association for Computing Machinery, 2018, pp. 404–407, ISBN: 9781450358897. DOI: https://www.doi.org/10.1145/3274895 . 3274903. [Online].
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. [Online]. Available: https://arxiv.org/abs/1201.6564.
J. Y. Yen, “Finding the k shortest loopless paths in a network,” Management Science, vol. 17, no. 11, pp. 712–716, 1971. DOI: https://doi.org/10.1287/mnsc.17.11.712.
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.
J. W. Suurballe, “Disjoint paths in a network,” Networks, vol. 4, no. 2, pp. 125–145, 1974. DOI: https://doi.org/10.1002/net.3230040204.
C. V. I. T. Ltd., Choice routing, http://www.camvit.com, 2005.
P. A. Lopez, M. Behrisch, L. Bieker-Walz, et al., “Microscopic traffic simulation using sumo,” in 2018 21st International Conference on Intelligent Transportation Systems (ITSC), 2018, pp. 2575–2582. DOI: https://www.doi.org/10.1109/ITSC.2018.8569938.
J. Argota S´anchez-Vaquerizo, “Getting real: The challenge of building and validating a large-scale digital twin of barcelona’s traffic with empirical data,” ISPRS International Journal of Geo-Information, vol. 11, no. 1, 2022, ISSN: 2220-9964. DOI: https://www.doi.org/10.3390 /ijgi11010024. [Online]. Available: https://www.mdpi.com/2220-9964/11/1/24.
A. Wegener, M. Pi ´ orkowski, M. Raya, H. Hellbr ¨uck, S. Fischer, and J.-P. Hubaux, “Traci: An interface for coupling road traffic and network simulators,” in Proceedings of the 11th Communications and Networking Simulation Symposium, ser. CNS ’08, Ottawa, Canada: Association for Computing Machinery, 2008, pp. 155–163, ISBN: 1565553187. DOI: https://www.doi.org/10.1145/1400713.1400740. [Online]. 1400740.
INFRAS, Handbuch für emissionsfaktoren, http://www.hbefa.net/, 2013.[21] D. Krajzewicz, M. Behrisch, P. Wagner, R. Luz, and M. Krumnow, “Second generation of pollutant emission models for sumo,” in Modeling Mobility with Open Data, M. Behrisch and M. Weber, Eds., Cham: Springer International Publishing, 2015, pp. 203–221.
L. Pappalardo, S. Rinzivillo, Z. Qu, D. Pedreschi, and F. Giannotti, “Understanding the patterns of car travel,” The European Physical Journal Special Topics, vol. 215, pp. 61–73, 2013.
R. Hariharan and K. Toyama, “Project lachesis: Parsing and modeling location histories,” vol. 3234, Oct. 2004, pp. 106–124, ISBN: 978-3-540-23558-3. DOI: https://www.doi.org/10.1007/978-3-540-30231-5_8.
L. Pappalardo, F. Simini, G. Barlacchi, and R. Pellungrini, Scikit-mobility: A python library for the analysis, generation and risk assessment of mobility data, 2019. DOI: https://www.doi.org/10.48550/ARXIV.1907.07062. [Online]. Available: https://arxiv.org/abs/1907.07062.
D. Braess, A. Nagurney, and T. Wakolbinger, “On a paradox of traffic planning,” Transportation Science, vol. 39, no. 4, pp. 446–450, Nov. 2005, ISSN: 1526-5447. DOI: https://www.doi.org/10.1287/trsc.1050.0127. [Online].
D. Braess, “U¨ ber ein paradoxon aus der verkehrsplanung,” Unternehmensforschung, vol. 12, pp. 258–268, 1968.
J. Wardrop, “Some theoretical aspects of road traffic research,” Proceedings of the Institutionof Civil Engineers, vol. 1, pp. 325–378, 1952.
Downloads
Published
How to Cite
Conference Proceedings Volume
Section
License
Copyright (c) 2023 Giuliano Cornacchia, Mirco Nanni, Dino Pedreschi, Luca Pappalardo
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
