TY - JOUR
T1 - Model Development of Ride Splitting Service with Resource Sharing Scheme on Ride Sourcing (Online Taxi) Services in Jakarta
AU - BURHAN, HELEN
AU - SOEHODHO, SUTANTO
AU - NAHRY, N.
N1 - Funding Information:
The authors would like to thank to Kemenristek Dikti and LPDP for scholarship in order the completion of doctoral studies at Universitas Indonesia.
Publisher Copyright:
© 2020. All Rights Reserved.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
PY - 2021/1/4
Y1 - 2021/1/4
N2 - This study aims to solve the increasing number of vehicles for ride-sourcing or online taxi service on the road and the operational issues in those services by developing an optimization model of ride-splitting services in the online taxi with a resource sharing (sharing platform) scheme. Ride-splitting service is a ride-sourcing service where one vehicle can serve two or more request customers at a similar time. Meanwhile, the resource-sharing scheme interlinks drivers from different platforms in providing services to the customers. That is, a driver from platform X can serve customers from platform Y and vice versa, with a predetermined profit sharing. We formulate the optimization problem as a new modified weighted bipartite matching and solve the problem using a greedy heuristic method. Based on the simulation, the proposed model can generate higher overall profit for all vehicles serving passengers, use fewer vehicles, and lower passengers’waiting time.
AB - This study aims to solve the increasing number of vehicles for ride-sourcing or online taxi service on the road and the operational issues in those services by developing an optimization model of ride-splitting services in the online taxi with a resource sharing (sharing platform) scheme. Ride-splitting service is a ride-sourcing service where one vehicle can serve two or more request customers at a similar time. Meanwhile, the resource-sharing scheme interlinks drivers from different platforms in providing services to the customers. That is, a driver from platform X can serve customers from platform Y and vice versa, with a predetermined profit sharing. We formulate the optimization problem as a new modified weighted bipartite matching and solve the problem using a greedy heuristic method. Based on the simulation, the proposed model can generate higher overall profit for all vehicles serving passengers, use fewer vehicles, and lower passengers’waiting time.
KW - Greedy Heuristic Method
KW - Modified Weighted Bipartite Matching
KW - Resource Sharing Scheme
KW - Ride Sourcing (Online Taxi) Services
KW - Ride Splitting Service
UR - http://www.scopus.com/inward/record.url?scp=85099955804&partnerID=8YFLogxK
U2 - 10.31436/IIUMEJ.V22I1.1520
DO - 10.31436/IIUMEJ.V22I1.1520
M3 - Article
AN - SCOPUS:85099955804
SN - 1511-788X
VL - 22
SP - 175
EP - 190
JO - IIUM Engineering Journal
JF - IIUM Engineering Journal
IS - 1
ER -