On-demand dynamic Bi-/multi-modal ride-sharing using optimal passenger-vehicle assignments

Existing mobility-on-demand service has a major inefficiency for its operating policy design by disregarding the opportunity in cooperation with other transportation networks. In this work, a dynamic bi-/multi-modal vehicle dispatching and routing algorithm is proposed to address the real-time operating policy of ride-sharing (feeder) services in coordination with the presence of existing public transportation networks. We propose a solution algorithm based on the concept of shareability to group a bundle of requests and find optimal passengers-vehicles assignment with least cost to ensure seamless bi-/multi modal trips. The proposed method is tested on a realistic transportation network with stochastic demand. This study provides a useful tool for real-time mobility-on-demand service planning and design in a multimodal transportation network.

[1]  Patrice Marcotte,et al.  Operators-Users Equilibrium Model in a Partially Regulated Transit System , 1992, Transp. Sci..

[2]  Hai Yang,et al.  A Game-Theoretic Analysis of Competition in a Deregulated Bus Market , 2005 .

[3]  Manuel Braun.  Multi-Modal Route Planning with Transfer Patterns , 2012 .

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

[5]  Joseph Ying Jun Chow,et al.  Symbiotic network design strategies in the presence of coexisting transportation networks , 2014 .

[6]  Tai-Yu Ma.  An A* Label-setting Algorithm for Multimodal Resource Constrained Shortest Path Problem , 2014 .

[7]  Emilio Frazzoli,et al.  Toward a Systematic Approach to the Design and Evaluation of Automated Mobility-on-Demand Systems: A Case Study in Singapore , 2014 .

[8]  Emilio Frazzoli,et al.  On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment , 2017, Proceedings of the National Academy of Sciences.

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

[10]  Richard F. Hartl,et al.  Variable neighborhood search for the dial-a-ride problem , 2010, Comput. Oper. Res..

[11]  Patrick T. Harker,et al.  Private Market Participation in Urban Mass Transportation: Application of Computable Equilibrium Models of Network Competition , 1988, Transp. Sci..

[12]  William H. K. Lam,et al.  THE GENERALIZED NASH EQUILIBRIUM MODEL FOR OLIGOPOLISTIC TRANSIT MARKET WITH ELASTIC DEMAND , 2005 .

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

[14]  Tai-Yu Ma,et al.  Modèle dynamique de transport basé sur les activités , 2007 .

[15]  Joseph Y. J. Chow,et al.  A scalable non-myopic dynamic dial-a-ride and pricing problem , 2015 .

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

[17]  Verena Schmid,et al.  Hybrid column generation and large neighborhood search for the dial-a-ride problem , 2013, Comput. Oper. Res..

[18]  W. Lam,et al.  Modeling Impact of Transit Operator Fleet Size under various Market Regimes with Uncertainty in Network , 2008 .

[19]  C. K. Y. Lin,et al.  A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources , 2011, Comput. Oper. Res..

[20]  Tai-Yu Ma.  A Cross Entropy Multiagent Learning Algorithm for Solving Vehicle Routing Problems with Time Windows , 2011, ICCL.