Designing stable ride-sharing for commuting trip chain with role flexibility.
Saved in:
| Title: | Designing stable ride-sharing for commuting trip chain with role flexibility. |
|---|---|
| Authors: | Peng, Zixuan1 (AUTHOR), Wang, Wensi2 (AUTHOR), Wang, Chenyu3 (AUTHOR) c.wang@tue.nl, Yu, Bin2 (AUTHOR) yubinyb@buaa.edu.cn |
| Source: | Transportation. Jun2026, Vol. 53 Issue 3, p1395-1427. 33p. |
| Subjects: | Ridesharing, Matching theory, Commuters, Transportation planning, Passenger traffic, Algorithms |
| Abstract: | In ride-sharing, fixing the roles of commuters with vehicles could come at an opportunity of missed balance between riders and drivers. The decisions made by commuters with vehicles about roles are related to both to-work travel and return-home travel. Commuters may choose not to drive when they have a confirmed ride back home. This study designs a stable ride-sharing model with role flexibility for the commuting trip chain. The preferences of commuters over matching partners in trip chains are formulated. A stable matching algorithm based on commuting trip chain is designed. To assess the performance of the proposed model and algorithm, real-life data from a resident trip survey in Dalian are used to design experimental cases. The results indicate that stable matching based on the trip chain is not a consequence of the repetition of successive one-period stable matching. Compared with matching in two phases, the matching rate of commuters increases by an average of 10%. When the number of commuters with role flexibility increases by four times, the matching rate of commuters increases by an average of 5.6%. [ABSTRACT FROM AUTHOR] |
| Copyright of Transportation is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In ride-sharing, fixing the roles of commuters with vehicles could come at an opportunity of missed balance between riders and drivers. The decisions made by commuters with vehicles about roles are related to both to-work travel and return-home travel. Commuters may choose not to drive when they have a confirmed ride back home. This study designs a stable ride-sharing model with role flexibility for the commuting trip chain. The preferences of commuters over matching partners in trip chains are formulated. A stable matching algorithm based on commuting trip chain is designed. To assess the performance of the proposed model and algorithm, real-life data from a resident trip survey in Dalian are used to design experimental cases. The results indicate that stable matching based on the trip chain is not a consequence of the repetition of successive one-period stable matching. Compared with matching in two phases, the matching rate of commuters increases by an average of 10%. When the number of commuters with role flexibility increases by four times, the matching rate of commuters increases by an average of 5.6%. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00494488 |
| DOI: | 10.1007/s11116-024-10533-1 |
