Optimization for dynamic ride-sharing: A review

Dynamic ride-share systems aim to bring together travelers with similar itineraries and time schedules on short-notice. These systems may provide significant societal and environmental benefits by reducing the number of cars used for personal travel and improving the utilization of available seat capacity. Effective and efficient optimization technology that matches drivers and riders in real-time is one of the necessary components for a successful dynamic ride-share system. We systematically outline the optimization challenges that arise when developing technology to support ride-sharing and survey the related operations research models in the academic literature. We hope that this paper will encourage more research by the transportation science and logistics community in this exciting, emerging area of public transportation.

[1]  M. Sol.  The general pickup and delivery problem , 2010 .

[2]  Otthein Herzog,et al.  SMIZE: A Spontaneous Ride-Sharing System for Individual Urban Transit , 2009, MATES.

[3]  Der-Horng Lee,et al.  Taxi Dispatch System Based on Current Demands and Real-Time Traffic Conditions , 2003 .

[4]  Qiang Meng,et al.  A decision support system for vehicle relocation operations in carsharing systems , 2009 .

[5]  Warren B. Powell,et al.  Dynamic Models for Freight Transportation , 2007 .

[6]  T F Golob,et al.  THE EFFECTIVENESS OF RIDESHARING INCENTIVES: DISCRETE-CHOICE MODELS OF COMMUTING IN SOUTHERN CALIFORNIA. REVISED EDITION , 1991 .

[7]  Ronald Fagin,et al.  A Fair Carpool Scheduling Algorithm , 1983, IBM J. Res. Dev..

[8]  Michael Weber,et al.  Evolutionary Multiobjective Route Planning in Dynamic Multi-hop Ridesharing , 2011, EvoCOP.

[9]  Ker-Tsung Lee,et al.  Planning and Design of a Taxipooling Dispatching System , 2005 .

[10]  Mark E. T. Horn,et al.  Fleet scheduling and dispatching for demand-responsive passenger services , 2002 .

[11]  Niels A. H. Agatz,et al.  The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .

[12]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

[13]  Donald J Dailey,et al.  Seattle smart traveler: dynamic ridematching on the World Wide Web , 1999 .

[14]  Roberto Baldacci,et al.  An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation , 2004, Oper. Res..

[15]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[16]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[17]  Gilbert Laporte,et al.  Chapter 7 Transportation on Demand , 2007, Transportation.

[18]  Michael Buchmann,et al.  Empty seats traveling : next-generation ridesharing and its potential to mitigate traffic- and emission problems in the 21st century , 2006 .

[19]  Richard F. Hartl,et al.  Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports , 2011, Comput. Oper. Res..

[20]  Vittorio Maniezzo,et al.  A distributed geographic information system for the daily car pooling problem , 2004, Comput. Oper. Res..

[21]  Hai Yang,et al.  The models and economics of carpools , 2000 .

[22]  Jian Yang,et al.  Real-Time Multivehicle Truckload Pickup and Delivery Problems , 2004, Transp. Sci..

[23]  G. Laporte,et al.  Transportation Demand , 2019, Energy: Supply and Demand.

[24]  Randolph W. Hall,et al.  Dynamic Ride-Sharing: Theory and Practice , 1997 .

[25]  N Künzli,et al.  Public-health impact of outdoor and traffic-related air pollution: a European assessment , 2000, The Lancet.

[26]  Bernhard Nebel,et al.  A Mechanism for Dynamic Ride Sharing Based on Parallel Auctions , 2011, IJCAI.

[27]  Jean-Christophe Vergnaud,et al.  Public health Impact of Outdoor and Traffic related Air Pollution , 2000 .

[28]  Warren B. Powell,et al.  A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers , 1996, Transp. Sci..

[29]  Warren B. Powell,et al.  The Dynamic Assignment Problem , 2004, Transp. Sci..

[30]  Ali Haghani,et al.  Real-Time Rideshare Matching Problem , 2010 .

[31]  Luca Quadrifoglio,et al.  Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints , 2008, CPAIOR.

[32]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[33]  Philip A. Gruebele.  Interactive System for Real Time Dynamic Multi-hop Carpooling , 2008 .

[34]  Warren B. Powell,et al.  On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance , 2000, Transp. Sci..

[35]  A. Santos,et al.  Summary of Travel Trends: 2009 National Household Travel Survey , 2011 .

[36]  P. S. Hu,et al.  Summary of Travel Trends , 2004 .

[37]  Xiugang Li,et al.  Feeder transit services: Choosing between fixed and demand responsive policy , 2010 .

[38]  Lars Völker,et al.  Fast Detour Computation for Ride Sharing , 2010, ATMOS.

[39]  James F. Campbell.  Strategic Network Design for Motor Carriers , 2005 .

[40]  Andrew Amey.  Proposed Methodology for Estimating Rideshare Viability Within an Organization: Application to the MIT Community , 2011 .

[41]  Martín Matamala,et al.  The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method , 2010, Eur. J. Oper. Res..

[42]  D. Schrank,et al.  THE 2004 URBAN MOBILITY REPORT , 2002 .

[43]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[44]  Irwin P. Levin,et al.  MEASUREMENT OF PSYCHOLOGICAL FACTORS AND THEIR ROLE IN TRAVEL BEHAVIOR , 1977 .

[45]  Yuval Rabani,et al.  Fairness in scheduling , 1995, SODA '95.

[46]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[47]  Elise Miller-Hooks,et al.  Fleet Management for Vehicle Sharing Operations , 2011, Transp. Sci..

[48]  Stephan Winter,et al.  Ad hoc shared‐ride trip planning by mobile geosensor networks , 2006, Int. J. Geogr. Inf. Sci..

[49]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[50]  Kalon L Kelley.  Casual carpooling—enhanced , 2007 .

[51]  Robert B. Dial,et al.  Autonomous dial-a-ride transit introductory overview , 1995 .

[52]  Luca Quadrifoglio,et al.  Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints , 2008, Eur. J. Oper. Res..

[53]  Chelsea C. White,et al.  A decision support system for the bimodal dial-a-ride problem , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[54]  Sibel A. Alumur,et al.  Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..

[55]  Gilbert Laporte,et al.  Rejoinder on: Static pickup and delivery problems: a classification scheme and survey , 2007 .

[56]  B. Brunekreef,et al.  Air pollution and health , 2002, The Lancet.

[57]  David W. Pentico,et al.  Assignment problems: A golden anniversary survey , 2007, Eur. J. Oper. Res..

[58]  Gilbert Laporte,et al.  Quality of service in dial-a-ride operations , 2009, Comput. Ind. Eng..

[59]  Moni Naor,et al.  On fairness in the carpool problem , 2005, J. Algorithms.

[60]  M. Ben-Ariva,et al.  METHODOLOGY FOR SHORT-RANGE TRAVEL DEMAND PREDICTIONS. ANALYSIS OF CARPOOLING INCENTIVES , 1977 .

[61]  António Pais Antunes,et al.  Optimization Approach to Depot Location and Trip Selection in One-Way Carsharing Systems , 2012 .

[62]  Jiamin Zhao,et al.  Service capacity design problems for mobility allowance shuttle transit systems , 2008 .

[63]  D. Hensher.  Climate change, enhanced greenhouse gas emissions and passenger transport: What can we do to make a difference? , 2008 .