2020
DOI: 10.1371/journal.pone.0229674
|View full text |Cite
|
Sign up to set email alerts
|

Matching algorithm for improving ride-sharing by incorporating route splits and social factors

Abstract: Increasing traffic congestion and the advancements in technology have fostered the growth of alternative transportation modes such as dynamic ride-sharing. Smartphone technologies have enabled dynamic ride-sharing to thrive, as this type of transportation aims to establish ride matches between people with similar routes and schedules on short notice. Many automated matching methods are designed to improve system performance; such methods include minimizing process time, minimizing total system cost or maximizi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(15 citation statements)
references
References 29 publications
(47 reference statements)
0
15
0
Order By: Relevance
“…Furthermore, the authors of [40] developed a ride-matching algorithm that splits the drivers' routes and matches riders and drivers again with an extra consideration of a Joint Socialness Score. The score involves data pertaining to the participants' gender, age, employment status and social tendencies and is used to increase the matching of riders which are in the same likelihood range.…”
Section: Heuristic and Metaheuristic Algorithms One-to-one Ridesharing Problemmentioning
confidence: 99%
“…Furthermore, the authors of [40] developed a ride-matching algorithm that splits the drivers' routes and matches riders and drivers again with an extra consideration of a Joint Socialness Score. The score involves data pertaining to the participants' gender, age, employment status and social tendencies and is used to increase the matching of riders which are in the same likelihood range.…”
Section: Heuristic and Metaheuristic Algorithms One-to-one Ridesharing Problemmentioning
confidence: 99%
“…They argued that this type of matching failure could not be fixed by adjusting the compensation scheme. A matching algorithm developed by Aydin et al [21]assigned new travel requests to the unmatched distance of ridesharing drivers' routes, which improved the satisfaction levels of drivers and reported a 33% increase in matching among drivers and riders.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Rudnicki et al [4] studied ridesharing with walking, where the roles of drivers and passengers were known and each driver was assigned to passengers with the same destination [4,5]. Other studies [6,20] have proposed route/hop planning schemes, such as: (a) car -> car -> car; (b) car; (c) car -> airplane -> bus; (d) foot -> car -> car -> car; (e) car -> subway -> bus; (f) bicycle -> car -> bicycle; (g) foot; (h) bicycle; (i) foot -> bus -> foot. In previous studies that were completed at UC Irvine [1,7], a multimodal ridesharing system was proposed to enhance the use of the LA Metro Red Line (a subway), allowing transfers between shared-ride cars and the LA Metro.…”
Section: Multimodal Ridesharing Systemmentioning
confidence: 99%