Nonprofit peer-to-peer ridesharing optimization

被引:23
作者
Sun, Yanshuo [1 ]
Chen, Zhi-Long [2 ]
Zhang, Lei [3 ]
机构
[1] Florida State Univ, FAMU FSU Coll Engn, Dept Ind & Mfg Engn, 2525 Pottsdamer St, Tallahassee, FL 32310 USA
[2] Univ Maryland, Robert H Smith Sch Business, 4321 Munching Hall, College Pk, MD 20742 USA
[3] Univ Maryland, Dept Civil & Environm Engn, 1173 Glenn Martin Hall, College Pk, MD 20742 USA
关键词
Dynamic rideshare; Set packing formulation; Graph theory; Column generation; Dispatching policies; VEHICLE-ROUTING PROBLEM; BRANCH-AND-PRICE; A-RIDE PROBLEM; DELIVERY PROBLEM; TIME WINDOWS; PICKUP; ALGORITHM; DRIVER; SERVICES; STRATEGY;
D O I
10.1016/j.tre.2020.102053
中图分类号
F [经济];
学科分类号
02 ;
摘要
Both for-profit and nonprofit peer-to-peer (P2P) ridesharing services have gained enormous popularity in recent years due to their advantages over solo driving and public transit. We study the rideshare matching and routing problem in a nonprofit P2P ridesharing system consisting of a matching agency, drivers and riders. The matching agency is a government or a not-for-profit organization and its objective is to maximize the societal benefits of ridesharing. The drivers involved are commuters and hence have their own travel plans, which are executed regardless of whether riders are matched with them. We consider both static and dynamic versions of the nonprofit P2P ridesharing problem. Existing modeling and solution approaches for similar P2P ridesharing problems can only solve relatively small problem instances optimally. We propose an exact solution algorithm for the static version of the problem by taking advantage of its special characteristics. This exact solution approach formulates and solves the problem as a set packing formulation using route-based variables, and uses an efficient graph-based approach to generate all necessary vehicle routes in the formulation quickly. We also develop a column generation (CG) based heuristic approach for the static problem. Finally, we propose two dynamic dispatching policies for the dynamic version of the problem. Our proposed exact algorithm solves very large problem instances (e.g., with 600 drivers and 1800 riders) of the static problem and our CG based heuristic can find near-optimal solutions for even larger instances of the static problem in short computation time. Our dynamic dispatching policies can generate near-optimal solutions for the dynamic problem in real-time fashion. We also generate some important insights based on some taxi trip data in Washington DC. First, P2P ridesharing can bring significant cost-saving, especially when the participants have a relatively flexible schedule. For every 10% increase in schedule flexibility, there is an about 4% to 7% increase in cost-saving. Second, the cost-saving due to ridesharing increases with the vehicle capacity, but this increase slows down quickly when the vehicle capacity reaches 4. Third, ridesharing generates more cost savings during peak hours and in urban areas.
引用
收藏
页数:26
相关论文
共 56 条
[1]   Optimization for dynamic ride-sharing: A review [J].
Agatz, Niels ;
Erera, Alan ;
Savelsbergh, Martin ;
Wang, Xing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) :295-303
[2]   Dynamic ride-sharing: A simulation study in metro Atlanta [J].
Agatz, Niels A. H. ;
Erera, Alan L. ;
Savelsbergh, Martin W. P. ;
Wang, Xing .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (09) :1450-1464
[3]  
Alonso-Mora J, 2017, IEEE INT C INT ROBOT, P3583, DOI 10.1109/IROS.2017.8206203
[4]   On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment [J].
Alonso-Mora, Javier ;
Samaranayake, Samitha ;
Wallar, Alex ;
Frazzoli, Emilio ;
Rus, Daniela .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2017, 114 (03) :462-467
[5]  
[Anonymous], 2014, SIAM, DOI DOI 10.1137/1.9781611973594
[6]   Crowdsourced Delivery-A Dynamic Pickup and Delivery Problem with Ad Hoc drivers [J].
Arslan, Alp M. ;
Agatz, Niels ;
Kroon, Leo ;
Zuidwijk, Rob .
TRANSPORTATION SCIENCE, 2019, 53 (01) :222-235
[7]  
Ashlagi I., 2018, ARXIV PREPRINT ARXIV
[8]   An Exact Algorithm for the Pickup and Delivery Problem with Time Windows [J].
Baldacci, Roberto ;
Bartolini, Enrico ;
Mingozzi, Aristide .
OPERATIONS RESEARCH, 2011, 59 (02) :414-426
[9]   Branch-and-price: Column generation for solving huge integer programs [J].
Barnhart, C ;
Johnson, EL ;
Nemhauser, GL ;
Savelsbergh, MWP ;
Vance, PH .
OPERATIONS RESEARCH, 1998, 46 (03) :316-329
[10]   A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem [J].
Berbeglia, Gerardo ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
INFORMS JOURNAL ON COMPUTING, 2012, 24 (03) :343-355