Multi-Objective Analysis of Ridesharing in Automated Mobility-on-Demand

Self-driving technology is expected to enable the realization of large-scale mobility-on-demand systems that employ massive ridesharing. The technology is being celebrated as a potential cure for urban congestion and others negative externalities of individual automobile transportation. In this paper, we quantify the potential of ridesharing with a fleet of autonomous vehicles by considering all possible trade-offs between the quality of service and operation cost of the system that can be achieved by sharing rides. We formulate a multi-objective fleet routing problem and present a solution technique that can compute Pareto-optimal fleet operation plans that achieve different trade- offs between the two objectives. Given a set of requests and a set of vehicles, our method can recover a trade-off curve that quantifies the potential of ridesharing with given fleet. We provide a formal optimality proof and demonstrate that the proposed method is scalable and able to compute such trade-off curves for instances with hundreds of vehicles and requests optimally. Such an analytical tool helps with systematic design of shared mobility system, in particular, it can be used to make principled decisions about the required fleet size.

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

[2]  Xuesong Zhou,et al.  Finding Optimal Solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A Dynamic Programming Approach Based on State-space-time Network Representations , 2015, ArXiv.

[3]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[4]  Emilio Frazzoli,et al.  Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems , 2012, IEEE Transactions on Automatic Control.

[5]  Paolo Santi,et al.  Supporting Information for Quantifying the Benefits of Vehicle Pooling with Shareability Networks Data Set and Pre-processing , 2022 .

[6]  G. Laporte,et al.  The diala-ride problem : models and algorithms , .

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

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

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

[10]  Lucio Grandinetti,et al.  The Multi-objective Multi-vehicle Pickup and Delivery Problem with Time Windows , 2014 .

[11]  Vijay Kumar,et al.  Privacy-preserving vehicle assignment for mobility-on-demand systems , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[12]  R. Tachet,et al.  Scaling Law of Urban Ride Sharing , 2016, Scientific Reports.

[13]  Jonathan P. How,et al.  Predictive positioning and quality of service ridesharing for campus mobility on demand systems , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[14]  Emilio Frazzoli,et al.  Robotic load balancing for mobility-on-demand systems , 2012, Int. J. Robotics Res..

[15]  Javier Alonso-Mora,et al.  Predictive routing for autonomous mobility-on-demand systems with ride-sharing , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[16]  Roberto Baldacci,et al.  An Exact Algorithm for the Pickup and Delivery Problem with Time Windows , 2011, Oper. Res..

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