Mobility Sharing as a Preference Matching Problem
Open Access
- 2 October 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 20 (7) , 2584-2592
Abstract
Traffic congestion, dominated by single-occupancy vehicles, reflects not only transportation system inefficiency and negative externalities but also a sociological state of human isolation. Advances in information and communication technology are enabling the growth of real-time ridesharing to improve system efficiency. While most ridesharing algorithms optimize fellow passenger matching based on efficiency criteria (maximum number of paired trips, minimum total vehicle-time, or vehicle-distance traveled), very few explicitly consider passengers' preference for their peers as the matching objective. The existing literature either considers the bipartite driver-passenger matching problem, which is structurally different from the monopartite passenger-passenger matching, or only considers the passenger-passenger problem in a simplified one-origin-multiple-destination setting. We formulate a general monopartite passenger matching model in a road network and illustrate the model by pairing 301,430 taxi trips in Manhattan in two scenarios: one considering 1000 randomly generated preference orders and the other considering four sets of group-based preference orders. In both scenarios, compared with efficiency-based matching models, preference-based matching improves the average ranking of paired fellow passenger to the near-top position of people's preference orders with only a small efficiency loss at the individual level and a moderate loss at the aggregate level. The near-top-ranking results fall in a narrow range even with the random variance of passenger preference as inputs.Keywords
Funding Information
- Singapore–MIT Alliance for Research and Technology (SMART) Future Mobility Program
- MIT Institute of Data, System and Society Seed Fund
This publication has 19 references indexed in Scilit:
- Quantifying the benefits of vehicle pooling with shareability networksProceedings of the National Academy of Sciences of the United States of America, 2014
- Ridesharing: The state-of-the-art and future directionsTransportation Research Part B: Methodological, 2013
- Optimization for dynamic ride-sharing: A reviewEuropean Journal of Operational Research, 2012
- Dynamic ride-sharing: A simulation study in metro AtlantaTransportation Research Part B: Methodological, 2011
- The New Mobilities ParadigmEnvironment and Planning A: Economy and Space, 2006
- Pairwise kidney exchangeJournal of Economic Theory, 2005
- A maximum stable matching for the roommates problemBIT Numerical Mathematics, 1990
- An efficient algorithm for the “stable roommates” problemJournal of Algorithms, 1985
- The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game TheoryJournal of Political Economy, 1984
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962