A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem

In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel my transferring between multiple drivers, and a driver can carry multiple riders. We propose 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. We conduct extensive numerical experiments to demonstrate the computational efficiency of the proposed algorithm and show its practical applicability to reasonably-sized dynamic ride-matching contexts. Finally, in the interest of even lower solution times, we propose heuristic solution methods, and investigate the trade-offs between solution time and accuracy.

[1]  Fabien Lehuédé,et al.  The Dial-A-Ride Problem with Transfers , 2014, Comput. Oper. Res..

[2]  Hassan Artail,et al.  The shared-taxi problem: Formulation and solution methods , 2014 .

[3]  Michael Weber,et al.  Ant Colony vs. Genetic Multiobjective Route Planning in Dynamic Multi-hop Ridesharing , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[4]  Niels A. H. Agatz,et al.  The Benefits of Meeting Points in Ride-Sharing Systems , 2015 .

[5]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

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

[7]  N. Sacco,et al.  Optimization of Dynamic Ridesharing Systems , 2013 .

[8]  Keivan Ghoseiri.  DYNAMIC RIDESHARE OPTIMIZED MATCHING PROBLEM , 2012 .

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

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

[11]  Michael Weber,et al.  A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows , 2012, GECCO '12.

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

[13]  David M. Stein,et al.  Scheduling Dial-a-Ride Transportation Systems , 1978 .

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

[15]  Manuela M. Veloso,et al.  Ridesharing with passenger transfers , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  David B. Shmoys,et al.  Mathematical Programming Guides Air-Ambulance Routing at Ornge , 2013, Interfaces.

[17]  Gerrit K. Janssens,et al.  Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots , 2014 .

[18]  Fabien Lehuédé,et al.  Optimization of a city logistics transportation system with mixed passengers and goods , 2017, EURO J. Transp. Logist..

[19]  Martin W. P. Savelsbergh,et al.  Optimization for dynamic ride-sharing: A review , 2012, Eur. J. Oper. Res..

[20]  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..

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

[22]  Fernando Ordóñez,et al.  Ridesharing: The state-of-the-art and future directions , 2013 .

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

[24]  Susan Heinrich.  Implementing Real-time Ridesharing in the San Francisco Bay Area , 2010 .

[25]  Susan Shaheen,et al.  Ridesharing in North America: Past, Present, and Future , 2012 .

[26]  Niels A. H. Agatz,et al.  Sustainable Passenger Transportation: Dynamic Ride-Sharing , 2010 .

[27]  H. Psaraftis.  An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[28]  Hiroyuki Iseki,et al.  Thinking Outside the Bus: Understanding User Perceptions of Waiting and Transferring in Order to Increase Transit Use , 2009 .