A novel algorithm for peer-to-peer ridesharing match problem
- 96 Downloads
Peer-to-peer (P2P) ridesharing is a promising mode of transportation that has gained popularity during the recent years. The widespread use of smart phones, mobile application development platforms and online payment systems provide new opportunities to enable P2P ridesharing. In this paper, we introduce a notion of two-sided matching to build a single-driver multiple-rider stable matching ridesharing model and propose a heuristic algorithm to establish stable or nearly stable matches. We conduct extensive numerical experiments to demonstrate the computational efficiency of the proposed algorithm and show its practical applicability to reasonably sized P2P ridesharing contexts. The results show that we can significantly increase the stability of ridesharing matching solutions at the cost of only a small degradation in system-wide performance.
KeywordsPeer-to-peer ridesharing Single-driver multiple-rider Stable matches Heuristic algorithm
The authors acknowledge the Scientific Research Foundation of Guangzhou University (Grant No. 69-18ZX10183), Key Research Project of Sichuan Science and Technology Department (Grant No. 18ZDYF1707).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- 3.Arslan A, Agatz N, Kroon LG, Zuidwijk RA (2016) Crowdsourced delivery-a pickup and delivery problem with ad-hoc drivers, Available at SSRNGoogle Scholar
- 8.Wang X, Agatz N, Erera A (2017) Stable matching for dynamic ride-sharing systems. Transp SciGoogle Scholar
- 20.A.A.R. Hosseinabadi, J. Vahidi, B. Saemi, A.K. Sangaiah and M. Elhoseny (2018) Extended genetic algorithm for solving open-shop scheduling problem. Soft Comput 1–18Google Scholar