A New Method for Forming Rideshare Groups

Nowadays, ridesharing has gained popularity as an alternative mode of transportation. It offers cost savings, convenience, environmental benefits, and social opportunities. This research aims at providing riders with the reliability of the route and the flexibility of the service. For this purpose, we mine the longest frequent movement from historical data. A novel algorithm for discovering rides hare groups based on the similarity of the users' longest frequent movements is proposed. In this way, the user does not have to search for a ride many times and does not have to wait too long as well because the group with a specific schedule and driver information can be excited and sent to the users in advance. The algorithm is evaluated based on synthetic datasets under different settings and compared with the existing ones. The experimental results of the proposed method is superior to the results of the previous algorithms in terms of execution time and the total travel distance.