A generalized ride-matching approach for sustainable shared mobility

  title={A generalized ride-matching approach for sustainable shared mobility},
  author={Seyed Mehdi Meshkani and Bilal Farooq},
  journal={Sustainable Cities and Society},
On-demand shared mobility is a promising and sustainable transportation approach that can mitigate vehicle externalities, such as traffic congestion and emission. On-demand shared mobility systems require matching of one (one-to-one) or multiple riders (many-to-one) to a vehicle based on real-time information. We propose a novel Graph-based Many-to-One ride-Matching (GMOMatch) algorithm for the dynamic many-to-one matching problem in the presence of traffic congestion. GMOMatch, which is an… 


On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
A more general mathematical model for real-time high-capacity ride-sharing that scales to large numbers of passengers and trips and dynamically generates optimal routes with respect to online demand and vehicle locations is presented.
Trip-based graph partitioning in dynamic ridesharing
A graph partitioning methodology based on the bipartite graph that arises in the one-to-one ride-matching problem is developed with the goal of reducing the overall computational complexity of the problem as well as providing high quality solutions.
19th International Symposium on Transportation and Traffic Theory Dynamic Ride-Sharing: a Simulation Study in Metro Atlanta
AbstractSmartphone technology enables dynamic ride-sharing systems that bring together people with similar itinerariesand time schedules to share rides on short-notice. This paper considers the
Real-time city-scale ridesharing via linear assignment problems
Abstract In this paper, we propose a novel, computational efficient, dynamic ridesharing algorithm. The beneficial computational properties of the algorithm arise from casting the ridesharing problem
A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem
This paper mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program and proposes a pre-processing procedure to reduce the size of the problem, and devise a decomposition algorithm to solve the original ride- matching problem to optimality by means of solving multiple smaller problems.
Novel dynamic formulations for real-time ride-sharing systems
Abstract This paper proposes new objective functions for the matching problem arising in ride-sharing systems based on trips’ spatial attributes. Novel dynamic matching policies are then proposed to
A Real-Time Algorithm to Solve the Peer-to-Peer Ride-Matching Problem in a Flexible Ridesharing System
Real-time peer-to-peer ridesharing is a promising mode of transportation that has gained popularity during the recent years, thanks to the wide-spread use of smart phones, mobile application
A survey of models and algorithms for optimizing shared mobility
This survey sets out to review recent research in this area, including different optimization approaches, and to provide guidelines and promising directions for future research, making a distinction between prearranged and real-time problem settings and their methods of solution.
An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
The main result of this work is an adaptive insertion algorithm capable of producing optimal solutions for a time constrained version of this problem, which was first studied by Psaraftis in the early 1980s.
A branch-and-cut algorithm for a realistic dial-a-ride problem
In this paper we study a realistic dial-a-ride problem which simultaneously considers multiple trips, heterogeneous vehicles, multiple request types, configurable vehicle capacity and manpower