Article
Version 1
Preserved in Portico This version is not peer-reviewed
Snapshot Optimal Real-time Ride Sharing
Version 1
: Received: 14 February 2024 / Approved: 14 February 2024 / Online: 14 February 2024 (13:50:20 CET)
A peer-reviewed article of this Preprint also exists.
Hassan, A.; Wallace, M.; Moser, I.; Harabor, D.D. Snapshot-Optimal Real-Time Ride Sharing. Information 2024, 15, 174. Hassan, A.; Wallace, M.; Moser, I.; Harabor, D.D. Snapshot-Optimal Real-Time Ride Sharing. Information 2024, 15, 174.
Abstract
Ridesharing effectively tackles urban mobility challenges by providing a service comparable to private vehicles while minimising resource usage.
Our research primarily concentrates on dynamic ridesharing, which conventionally involves connecting drivers with passengers in need of transportation. The process of one-to-one matching presents a complex challenge, particularly when addressing it on a large scale, as the substantial number of potential matches make the attainment of a global optimum a challenging endeavour.
This paper aims to address the absence of an optimal approach for dynamic ridesharing by refraining from conventional heuristic-based methods, commonly used to achieve timely solutions in large-scale ride-matching. We propose a novel approach that provides snapshot optimal solutions for various forms of one-to-one matching, ensuring they are generated within an acceptable timeframe for service providers.
Additionally, we introduce and solve a new variant where the system itself provides the vehicles. The efficacy of our methodology is substantiated through experiments carried out with real-world data extracted from the openly available New York City taxicab dataset.
Keywords
Ridesharing; Ridematching; Shared Mobility
Subject
Computer Science and Mathematics, Artificial Intelligence and Machine Learning
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment