Two-phase optimization model for ride-sharing with transfers in short-notice evacuations

Abstract Optimization of on-demand transportation provisions and ride-sharing services in evacuations may provide increased network capacity and enhanced evacuation performance to transportation systems and improve equity and disaster preparedness for community and society. This paper proposes a two-phase model for optimizing trip planning and operations by integrating a ride-sharing process in short-notice evacuations, to allow a joint optimization of driver-rider matching and necessary transfer connections among shared vehicle trips. In the first phase, following network topology information and personal requests, a vehicle-space-time hyper dimensional network is developed by constructing vehicle-space-time vertexes and arcs. In the second phase, based on the constructed vehicle-space-time network, a new time-discretized multi-rider multi-driver network flow model is built to formulate ride-sharing with connecting transfers. A Lagrangian relaxation solution approach is designed to solve the model in a real-world network scenario. Numerical analyses are conducted with considerations given to the three operating parameters (detour tolerance of driver, penalty factor for transfer time, and maximum allowable parking time) in the method, and the analysis results show that the proposed model can not only meet the evacuation trip needs of the participating parties but it also supports personalized requests and on-demand accesses. A small sample network is used to theoretically test the whole model and the underlying concepts and solution strategy to show each step implemented in details, and finally the applicability of the method is demonstrated using the Chicago City network.

[1]  Srinivas Peeta,et al.  An aggregate approach to model evacuee behavior for no-notice evacuation operations , 2013 .

[2]  Douglas R. Bish,et al.  Planning for a bus-based evacuation , 2011, OR Spectr..

[3]  Yingyan Lou,et al.  Pickup Locations and Bus Allocation for Transit-Based Evacuation Planning with Demand Uncertainty , 2014 .

[4]  Shaligram Pokharel,et al.  Optimization models in emergency logistics: A literature review , 2012 .

[5]  Brian Wolshon,et al.  PLANNING FOR THE EVACUATION OF NEW ORLEANS , 2002 .

[6]  Martin W. P. Savelsbergh,et al.  The Continuous-Time Service Network Design Problem , 2017, Oper. Res..

[7]  Lixing Yang,et al.  Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations , 2017 .

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

[9]  Vincent T'Kindt,et al.  A two-stage robustness approach to evacuation planning with buses , 2015 .

[10]  Fabien Lehuédé,et al.  An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers , 2011, Transp. Sci..

[11]  Sung Hoon Chung,et al.  Disaster relief routing under uncertainty: A robust optimization approach , 2018, IISE Trans..

[12]  Chung-Cheng Lu,et al.  Eco-system optimal time-dependent flow assignment in a congested network , 2016 .

[13]  Michael K. Lindell,et al.  Logistics of hurricane evacuation in Hurricanes Katrina and Rita , 2012 .

[14]  Pamela Murray-Tuite,et al.  Analysis of hurricane evacuee mode choice behavior , 2014 .

[15]  Hossein Hashemi,et al.  Modeling Framework and Decomposition Scheme for On‐Demand Mobility Services with Ridesharing and Transfer , 2019, Comput. Aided Civ. Infrastructure Eng..

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

[17]  A. Mahjoub,et al.  The splittable pickup and delivery problem with reloads , 2008 .

[18]  Jia Yuan Yu,et al.  Ridesharing for emergency evacuation , 2017, INFOR Inf. Syst. Oper. Res..

[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]  Robert Shorten,et al.  Stochastic optimization approach for the car placement problem in ridesharing systems , 2015 .

[22]  Ziyou Gao,et al.  Dynamic passenger demand oriented metro train scheduling with energy-efficiency and waiting time minimization: Mixed-integer linear programming approaches , 2017 .

[23]  Jiangtao Liu,et al.  Capacitated transit service network design with boundedly rational agents , 2016 .

[24]  Yue Liu,et al.  Strategic evacuation planning with pedestrian guidance and bus routing: a mixed integer programming model and heuristic solution , 2016 .

[25]  Jeffery L. Kennington,et al.  The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment , 2010, INFORMS J. Comput..

[26]  D. B. Hess,et al.  Multi-Modal Mass Evacuation in Upstate New York: A Review of Disaster Plans , 2007 .

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

[28]  Pamela Murray-Tuite,et al.  Evacuation transportation modeling: An overview of research, development, and practice , 2013 .

[29]  Vedat Bayram,et al.  Optimization models for large scale network evacuation planning and management: A literature review , 2016 .

[30]  Hisashi Kubota,et al.  Demand variations and evacuation route flexibility in short-notice bus-based evacuation planning , 2017 .

[31]  Hajo A. Reijers,et al.  The Share-a-Ride Problem: People and parcels sharing taxis , 2014, Eur. J. Oper. Res..

[32]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[33]  Anangur Vairavel,et al.  Hurricane Evacuation Planning using Public Transportation , 2017 .