MODEL DEVELOPMENT OF RIDE SPLITTING SERVICE WITH RESOURCE SHARING SCHEME ON RIDE SOURCING (ONLINE TAXI) SERVICES IN JAKARTA

Helen Burhan; Sutanto  Soehodho; Nahry Nahry

doi:10.31436/iiumej.v22i1.1520

Authors

Helen Burhan Universitas Indonesia https://orcid.org/0000-0001-9643-8143
Sutanto Soehodho Universitas Indonesia https://orcid.org/0000-0001-7476-2591
Nahry Nahry Universitas Indonesia https://orcid.org/0000-0003-2116-8470

DOI:

https://doi.org/10.31436/iiumej.v22i1.1520

Keywords:

ride sourcing (online taxi) service, ride splitting service, resource sharing scheme, modified weighted bipartite matching, greedy heuristic method

Abstract

ABSTRACT: 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.

ABSTRAK: Kajian ini bertujuan menyelesaikan jumlah penambahan kenderaan angkutan-berpusat atau servis teksi dalam talian di atas jalan raya dan isu operasi dalam perkhidmatan dengan membangunkan model pengoptimuman pada servis angkutan-pecahan bagi teksi dalam talian dengan skim perkongsian sumber (platform bersama). Servis angkutan-pecahan adalah servis angkutan-berpusat di mana satu kenderaan menyediakan perkhidmatan kepada dua atau lebih permintaan pengguna pada satu-satu masa. Manakala, perkongsian sumber menghubungkan pemandu dengan platform berlainan dalam menyediakan servis untuk penumpang. Iaitu, pemandu platform X boleh mengangkut penumpang platform Y dan sebaliknya, dengan menentukan terlebih dahulu keuntungan bersama. Kajian ini diformulasi dengan pengoptimuman masalah sebagai perubahan terbaru dalam menilai kesesuian kedua-dua pihak dan menyelesaikan masalah menggunakan kaedah heuristik rakus. Berdasarkan simulasi ini, model yang dicadangkan dapat menghasilkan keuntungan keseluruhan lebih tinggi bagi semua kenderaan perkhidmatan, dengan mengurangkan jumlah kenderaan dan masa menunggu penumpang.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

References

Burhan, H., Soehodho, S., and Nahry. (2017). Review on the Development of Ride Sharing System using Online Transportation Service in Jakarta. Proceeding of 6th IEEE International Conference on Advanced Logistics and Transport, pp.173-178.

Anderson, D. N.,(2014). “Not Just A Taxi’? For-Profit Ridesharing, Driver Strategies, and VMT. Transportation 41, pp.1099–1117. http://dx.doi.org/10.1007/ s11116-014-9531-8.

Rayle, L., Dai, D., Chan, N., Cervero,R., and Shaheen, S. (2015). Just a better taxi? A survey-based comparison of taxis, transit, and ridesourcing services in San Francisco. Transp. Policy, pp.168–178.

Shaheen, S., Cohen, a., and Zohdy, I. (2016). Shared Mobility: Current Practices and Guiding Principles. U.S. Department of Transportation, Federal Highway Administration. Report No. FHWA-HOP-16-022.

Chen, L., Mislove, A., and Wilson, C. (2015). Peeking Beneath the Hood of Uber. In Proc. of the ACM Conference on Internet Measurement Conference, ACM.

Burhan, H., Soehodho, S., and Nahry. (2019). A Resource Sharing (Sharing Platform) Scheme on Online Taxi Services. MATEC Web of Conferences,vol. 270, art.no.03010.

Agatz, N.A.H., Erera, A.L., Savelsbergh, M.W.P., and Wang, X. (2012). Optimization for dynamic ride-sharing: a review. European Journal of Operational Research, vol.223 (2), pp.295–303.

Lu, Q., and Dessouky, M. (2006). A new insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows. European Journal of Operational Research, vol.175 (2), pp.672–687.

Dumas, Y., Desrosiers, J., and Soumis, F. (1991). The pickup and delivery problem with time windows. European Journal of Operations Research, vol.54, pp.7–22.

Toth,P. and Vigo, D. (2002). The Vehicle Routing Problem. Siam, Philadelphia http://dx.doi.org/10.1137/1.9780898718515.

Hosni, H., Naoum-Sawaya, J., and Artail, H. (2014). The shared-taxi problem: Formulation and solution methods. Transp. Res. Part B: Methodol. 70, pp. 303–318.

Wang, X., Dessouky, M., and Ordonez, F. (2015). A pickup and delivery problem for ridesharing considering congestion. Transp. Lett.: Int. J. Transp. Res.,1942787515Y- 000000002.

Santos, D.O., and Xavier, E.C. (2015). Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive. Expert Systems with Applications, vol. 42, pp.6728–6737.

Mahmoudi, M., and Zhou, X. (2017). Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: a dynamic programming approach based on state-space-time network representations. Transport. Res. Part B: Methodol. Vol.89, pp.19–42.

Bei, X., and Zhang, S. (2018). Algorithms for trip-vehicle assignment in ride-sharing. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, pp. 3–9.

Banerjee, S., Johari, R., and Riquelme, C. (2015). Pricing in ride-share platforms: A queueing-theoretic approach. Working Paper. Available at SSRN: https://ssrn.com/abstract=2568258 or http://dx.doi.org/10.2139/ssrn.2568258.

Chen, Y., and Hu, M. (2017). Pricing and Matching with Forward-Looking Buyers and Sellers. Working Paper. Available at SSRN: https://ssrn.com/abstract=2859864 or http://dx.doi.org/10.2139/ssrn.2859864.

Zha, L., Yin, Y., and Xu, Z. (2018). Geometric matching and spatial pricing in ride-sourcing markets. Transportation Research Part C: Emerging Technologies, Vol.92, pp.58-75.

Yang, H., Shao, C., Wang, H., and Ye, J. (2018). Integrated Reward Scheme and Surge Pricing in a Ride Sourcing Market. Report, June 18, 2018. Available at SSRN: https://ssrn.com/abstract=3198081 or http://dx.doi.org/10.2139/ssrn.3198081.

Evans, J.R., and Minieka, E. (1992). Optimization algorithms for networks and graphs, 2nd edition Revised. New York.