UCarpooling: decongesting traffic through carpoolingusing automatic pairings

Authors

  • Alejandro Lugo Universidad Católica "Nuestra Señora de la Asunción"
  • Nathalie Aquino Universidad Católica "Nuestra Señora de la Asunción"
  • Magalí González Departamento de Electrónica e Informática - Universidad Católica Nuestra Señora de la Asunción
  • Luca Cernuzzi Universidad Católica "Nuestra Señora de la Asunción"
  • Ronald Chenú Universidad Católica "Nuestra Señora de la Asunción"

DOI:

https://doi.org/10.19153/cleiej.24.2.10

Keywords:

carpool, commuting, matcher, simulation

Abstract

A low average number of people per private vehicle and inappropriate road infrastruc-ture results in heavy traffic that wastes space, time and money for the people involved.To optimize these resources, it is intended to promotecarpoolingbetween people whoshare the same destination, for example, colleagues at work or students at a university.This paper presents UCarpooling, a matching system for commuting between people inthe same institution. UCarpooling is aimed at optimizing the number of passengers invehicles during routine trips to and from work or study. The difference with respect toother similar proposals is that UCarpooling takes into account logistical details (place ofdeparture, time of entry, etc.) and personal traits (if you smoke, what genres of musicyou listen to, etc.) as variables to calculate the percentage compatibility that differentpeople have to carry out a carpool. A simulation of the use of UCarpooling in a universityin Asuncion, Paraguay, yields favorable data reaching the conclusion that its adoptionis quite beneficial for the institution that adopts it, the people who use it, and the citieswhere it is adopted.

References

P. Fauvety, M. Fatecha, A. Lugo, J. Olivera, N. Aquino, R. Chenu-Abente, J. Paniagua,and J. Saldivar, “Percepcion ciudadana acerca de los problemas de movilidad de asuncion,”Universidad Catolica "Nuestra Señora de la Asuncion", Tech. Rep., June 2018. [Online]. Available:https://smarttraffic.com.py/reports/period1-interviews-survey.pdf

B. P. Bruck, V. Incerti, M. Iori, and M. Vignoli, “Minimizing co2 emissions in a practical dailycarpooling problem,”Computers Operations Research, vol. 81, pp. 40 – 50, 2017. [Online]. Available:http://www.sciencedirect.com/science/article/pii/S030505481630301X

F. Hsieh, “Car pooling based on trajectories of drivers and requirements of passengers,” in2017 IEEE31st International Conference on Advanced Information Networking and Applications (AINA), March2017, pp. 972–978.

H.-S. J. Tsao and M. Eirinaki, “A human-centered credit-banking system for convenient, fairand secure carpooling among members of an association,”Procedia Manufacturing, vol. 3,pp. 3599 – 3606, 2015, 6th International Conference on Applied Human Factors andErgonomics (AHFE 2015) and the Affiliated Conferences, AHFE 2015. [Online]. Available:http://www.sciencedirect.com/science/article/pii/S235197891500730116

C. Huang, D. Zhang, Y.-W. Si, and S. C. H. Leung, “Tabu search for the real-world carpoolingproblem,”Journal of Combinatorial Optimization, vol. 32, no. 2, pp. 492–512, Aug 2016. [Online].Available: https://doi.org/10.1007/s10878-016-0015-y

Z. Hong, Y. Chen, H. S. Mahmassani, and S. Xu, “Commuter ride-sharing using topology-basedvehicle trajectory clustering: Methodology, application and impact evaluation,”TransportationResearch Part C: Emerging Technologies, vol. 85, pp. 573 – 590, 2017. [Online]. Available:http://www.sciencedirect.com/science/article/pii/S0968090X17302930

R. Li, Z. Liu, and R. Zhang, “Studying the benefits of carpooling in an urban area using automaticvehicle identification data,”Transportation Research Part C: Emerging Technologies, vol. 93, pp. 367 –380, 2018. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0968090X18308787

C. Giglio and R. Palmieri, “An ict solution for shared mobility in universities,” inProceedings of theSecond International Afro-European Conference for Industrial Advancement AECIA 2015, A. Abraham,K. Wegrzyn-Wolska, A. E. Hassanien, V. Snasel, and A. M. Alimi, Eds. Cham: Springer InternationalPublishing, 2016, pp. 205–215.

H. Abdel-Latif, K. Elaraby, A. Alsobky, and A. Mohamed,Car-Pooling Attractiveness Modeling inGreater Cairo Organizations – A Case Study, 07 2018, pp. 21–30.

N. Silva, D. Carvalho, A. C. Pereira, F. Mourão, and L. Rocha, “The pure cold-start problem: A deep study about how to conquer first-time users in recommendationsdomains,”Information Systems, vol. 80, pp. 1 – 12, 2019. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0306437918303260

F. Bachmann, A. Hanimann, J. Artho, and K. Jonas, “What drives people to carpool? explaining car-pooling intention from the perspectives of carpooling passengers and drivers,”Transportation ResearchPart F Traffic Psychology and Behaviour, vol. 59, pp. 260–268, 10 2018.

D. B. Johnson, “A note on dijkstra’s shortest path algorithm,”J. ACM, vol. 20, no. 3, p. 385–388, Jul.1973. [Online]. Available: https://doi.org/10.1145/321765.321768

M. Zeni, “Bridging sensor data streams and human knowledge,” Ph.D. dissertation, Università degliStudi di Trento, 11 2017.

I. Hussain, L. Knapen, S. Galland, A.-U.-H. Yasar, T. Bellemans, D. Janssens, and G. Wets, “Agent-based simulation model for long-term carpooling: Effect of activity planning constraints,” vol. 52, 052015.

C. Wohlin, P. Runeson, M. Höst, M. C. Ohlsson, and B. Regnell,Experimentation in SoftwareEngineering. Springer, 2012. [Online]. Available: https://doi.org/10.1007/978-3-642-29044-217

Downloads

Published

2021-08-12

Issue

Vol. 24 No. 2 (2021): Regular papers and Special Issue for CLEI 2020 Best Papers

Section

Articles

License

Copyright (c) 2021 Magalí González, Alejandro Lugo, Nathalie Aquino, Luca Cernuzzi, Ronald Chenú

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

CLEIej is supported by its home institution, CLEI, and by the contribution of the Latin American and international researchers community, and it does not apply any author charges whatsoever for submitting and publishing. Since its creation in 1998, all contents are made publicly accesibly. The current license being applied is a (CC)-BY license (effective October 2015; between 2011 and 2015 a (CC)-BY-NC license was used).