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

Basit Öğe Kaydı
dc.contributor.authorAydın, Ömer Faruk
dc.contributor.authorGökaşar, Ilgın
dc.contributor.authorKalan, Onur
dc.date.accessioned2021-01-08T21:51:20Z
dc.date.available2021-01-08T21:51:20Z
dc.date.issued2020
dc.departmentTAÜ, Mühendislik Fakültesi, İnşaat Mühendisliği Bölümüen_US
dc.descriptionGOKASAR, ILGIN/0000-0001-9896-9220; Aydin, Omer Faruk/0000-0001-9345-3997en_US
dc.descriptionWOS:000535264000042en_US
dc.descriptionPubMed: 32130273en_US
dc.description.abstractIncreasing 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 maximizing total distance savings. However, the results may not provide the maximum benefits for the participants. This paper intends to develop an algorithm for optimizing matches when considering participants' gender, age, employment status and social tendencies. The proposed matching algorithm also splits unmatched parts of drivers' routes and creates new travel requests to find additional matches using these unmatched parts. Accordingly, this paper performs an extensive simulation study to assess the performance of the proposed algorithm. The simulation results indicate that route splits may increase the number of matches significantly when there is a shortage of drivers. Furthermore, the paper demonstrates the effects and potential benefits of utilizing a social compatibility score in the objective function.
dc.identifier.doi10.1371/journal.pone.0229674
dc.identifier.issn1932-6203
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-85081039288
dc.identifier.scopusqualityQ1
dc.identifier.urihttp://doi.org/10.1371/journal.pone.0229674
dc.identifier.urihttps://hdl.handle.net/20.500.12846/156
dc.identifier.volume15en_US
dc.identifier.wosWOS:000535264000042
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.indekslendigikaynakPubMed
dc.institutionauthorAydın, Ömer Faruk
dc.language.isoen
dc.publisherPublic Library Science
dc.relation.ispartofPlos One
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleMatching algorithm for improving ride-sharing by incorporating route splits and social factors
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
00156.pdf
Boyut:
1.42 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
İnşaat Mühendisliği Bölümü Koleksiyonu
PubMed İndeksli Yayın Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu