Carpool Matching by Preferences for the CSUSM Community
Saved in:
| Title: | Carpool Matching by Preferences for the CSUSM Community |
|---|---|
| Authors: | Adriana Caetano |
| Contributors: | Ali Ahmadinia, Sreedevi Gutta |
| Publisher Information: | California State University, San Marcos Science, Technology, Engineering & Math Computer Science & Information Systems |
| Publication Year: | 2022 |
| Subject Terms: | Long-term carpooling, Greedy approach, Preferences matching, Heuristic compatibility function |
| Description: | Carpooling is an alternative transportation mode where two people that are not from the same household share a vehicle to get to a destination. It reduces traffic and emissions, it helps reducing costs for users, and it can be a social time for participants. University students can benefit from carpooling, not only on transportation savings, but also in strengthening relationships with other students. However, creating long-term carpooling for university students with varied schedules and spread-out locations is not a simple task. In this project, we created an automated tool to create carpools for the CSUSM community based on user's profile and preferences. We take a greedy approach, to pair drivers with riders when searching location and schedule matches, with a heuristic function, to compute their compatibility score. We have pre-processed routes from most common locations saved in the database, which speeds up the computation time. For the target pool size of 1500 candidates, carpools can be formed in less than a minute and over 80% of the candidates are able to find ride-mates. |
| Document Type: | thesis |
| Language: | English |
| Relation: | http://hdl.handle.net/20.500.12680/zp38wk852 |
| Availability: | https://hdl.handle.net/20.500.12680/zp38wk852 |
| Accession Number: | edsbas.6F6315DF |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | Carpooling is an alternative transportation mode where two people that are not from the same household share a vehicle to get to a destination. It reduces traffic and emissions, it helps reducing costs for users, and it can be a social time for participants. University students can benefit from carpooling, not only on transportation savings, but also in strengthening relationships with other students. However, creating long-term carpooling for university students with varied schedules and spread-out locations is not a simple task. In this project, we created an automated tool to create carpools for the CSUSM community based on user's profile and preferences. We take a greedy approach, to pair drivers with riders when searching location and schedule matches, with a heuristic function, to compute their compatibility score. We have pre-processed routes from most common locations saved in the database, which speeds up the computation time. For the target pool size of 1500 candidates, carpools can be formed in less than a minute and over 80% of the candidates are able to find ride-mates. |
|---|