Dynamic Ride-Matching for Large-Scale Transportation Systems
dc.authorid | de Souza, Felipe/0000-0002-4858-141X | |
dc.authorid | Auld, Joshua/0000-0002-2492-0093 | |
dc.authorid | Cokyasar, Taner/0000-0001-9687-6725 | |
dc.contributor.author | Cokyasar, Taner | |
dc.contributor.author | de Souza, Felipe | |
dc.contributor.author | Auld, Joshua | |
dc.contributor.author | Verbas, Omer | |
dc.date.accessioned | 2025-03-17T12:25:33Z | |
dc.date.available | 2025-03-17T12:25:33Z | |
dc.date.issued | 2022 | |
dc.department | Tarsus Üniversitesi | |
dc.description.abstract | Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem's network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time. | |
dc.description.sponsorship | U.S. Department of Energy, Vehicle Technologies Office, under the Systems and Modeling for Accelerated Research in Transportation Mobility Laboratory Consortium, an initiative of the Energy Efficient Mobility Systems Program | |
dc.description.sponsorship | The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This material is based on work supported by the U.S. Department of Energy, Vehicle Technologies Office, under the Systems and Modeling for Accelerated Research in Transportation Mobility Laboratory Consortium, an initiative of the Energy Efficient Mobility Systems Program. | |
dc.identifier.doi | 10.1177/03611981211049422 | |
dc.identifier.endpage | 182 | |
dc.identifier.issn | 0361-1981 | |
dc.identifier.issn | 2169-4052 | |
dc.identifier.issue | 3 | |
dc.identifier.scopus | 2-s2.0-85128174900 | |
dc.identifier.scopusquality | Q2 | |
dc.identifier.startpage | 172 | |
dc.identifier.uri | https://doi.org/10.1177/03611981211049422 | |
dc.identifier.uri | https://hdl.handle.net/20.500.13099/1737 | |
dc.identifier.volume | 2676 | |
dc.identifier.wos | WOS:000712152000001 | |
dc.identifier.wosquality | Q3 | |
dc.indekslendigikaynak | Web of Science | |
dc.indekslendigikaynak | Scopus | |
dc.language.iso | en | |
dc.publisher | Sage Publications Inc | |
dc.relation.ispartof | Transportation Research Record | |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
dc.rights | info:eu-repo/semantics/closedAccess | |
dc.snmz | KA_WOS_20250316 | |
dc.subject | public transportation | |
dc.subject | innovative public transportation services and technologies | |
dc.subject | mobility as a service (MaaS) | |
dc.subject | rural | |
dc.subject | intercity bus | |
dc.subject | specialized transportation | |
dc.title | Dynamic Ride-Matching for Large-Scale Transportation Systems | |
dc.type | Article |