The electric autonomous dial-a-ride problem

Abstract In the Dial-a-Ride-Problem (DARP) a fleet of vehicles provides shared-ride services to users specifying their origin, destination, and preferred arrival time. Typically, the problem consists of finding minimum cost routes, satisfying operational constraints such as time-windows, origin-destination precedences, user maximum ride-times, and vehicle maximum route-durations. This paper presents a problem variant for the DARP which considers the use of electric autonomous vehicles (e-ADARP). The problem covers battery management, detours to charging stations, recharge times, and selection of destination depots, along with classic DARP features. The goal of the problem is to minimize a weighted objective function consisting of the total travel time of all vehicles and excess ride-time of the users. We formulate the problem as a 3-index and a 2-index mixed-integer-linear program and devise a branch-and-cut algorithm with new valid inequalities derived from e-ADARP properties. Computational experiments are performed on adapted benchmark instances from DARP literature and on instances based on real data from Uber Technologies Inc. Instances with up to 5 vehicles and 40 requests are solved to optimality.

[1]  Gopala Krishna Reddy Kakivaya,et al.  INTRACTABILITY OF THE DIAL-A-RIDE PROBLEM AND A MULTIOBJECTIVE SOLUTION USING SIMULATED ANNEALING , 1998 .

[2]  Kris Braekers,et al.  Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation , 2017, Comput. Oper. Res..

[3]  Yuri Malitsky,et al.  Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering , 2013, IJCAI.

[4]  Dominik Goeke,et al.  Routing a mixed fleet of electric and conventional vehicles , 2015, Eur. J. Oper. Res..

[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]  Wei-Yin Loh,et al.  Classification and regression trees , 2011, WIREs Data Mining Knowl. Discov..

[7]  Richard F. Hartl,et al.  The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations , 2013, Eur. J. Oper. Res..

[8]  Oya Ekin Karasan,et al.  Minimum cost path problem for Plug-in Hybrid Electric Vehicles , 2015 .

[9]  Nelishia Pillay,et al.  Vehicle Routing Problems , 2018 .

[10]  Kris Braekers,et al.  Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem , 2016 .

[11]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[12]  Iain Dunning,et al.  JuMP: A Modeling Language for Mathematical Optimization , 2015, SIAM Rev..

[13]  Stefan Bock,et al.  Pro-active real-time routing in applications with multiple request patterns , 2016, Eur. J. Oper. Res..

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

[15]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[16]  Naoufel Cheikhrouhou,et al.  The dial-a-ride problem with electric vehicles and battery swapping stations , 2018, Transportation Research Part E: Logistics and Transportation Review.

[17]  Nan Xia,et al.  A model for the fleet sizing of demand responsive transportation services with time windows , 2006 .

[18]  Andy Liaw,et al.  Classification and Regression by randomForest , 2007 .

[19]  Nikolaos Geroliminis,et al.  Dial-a-Ride Transit Systems: Optimization and adaptive network design strategies for large complex networks , 2016 .

[20]  P. Healy,et al.  A new extension of local search applied to the Dial-A-Ride Problem , 1995 .

[21]  Tore Grünert,et al.  Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration , 2005, J. Heuristics.

[22]  Gilbert Laporte,et al.  Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..

[23]  Daniel J. Fagnant,et al.  Preparing a Nation for Autonomous Vehicles: Opportunities, Barriers and Policy Recommendations , 2015 .

[24]  Hajo A. Reijers,et al.  An adaptive large neighborhood search heuristic for the share-a-ride problem , 2016, Comput. Oper. Res..

[25]  Sophie N. Parragh.  Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem , 2011, Transportation research. Part C, Emerging technologies.

[26]  Walter Ukovich,et al.  A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem , 2006, Eur. J. Oper. Res..

[27]  Stefan Bock,et al.  A general approach for controlling vehicle en-route diversions in dynamic vehicle routing problems , 2015 .

[28]  Navdeep Jaitly,et al.  Pointer Networks , 2015, NIPS.

[29]  Richard F. Hartl,et al.  Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem , 2014, Eur. J. Oper. Res..

[30]  E. Balas,et al.  Branch and Bound Methods for the Traveling Salesman Problem , 1983 .

[31]  David Pisinger,et al.  Large Neighborhood Search , 2018, Handbook of Metaheuristics.

[32]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[33]  Claudia Archetti,et al.  A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem , 2018, Comput. Oper. Res..

[34]  Yoshua Bengio,et al.  Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon , 2018, Eur. J. Oper. Res..

[35]  Paul Schonfeld,et al.  Optimizing dial-a-ride services in Maryland: Benefits of computerized routing and scheduling , 2015 .

[36]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[37]  Gilbert Laporte,et al.  A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem , 2012, INFORMS J. Comput..

[38]  Xavier Gandibleux,et al.  A heuristic two‐phase solution approach for the multi‐objective dial‐a‐ride problem , 2009, Networks.

[39]  Andrea Lodi,et al.  Learning a Classification of Mixed-Integer Quadratic Programming Problems , 2017, CPAIOR.

[40]  Daniele Vigo,et al.  The Hybrid Electric Vehicle - Traveling Salesman Problem , 2016, Eur. J. Oper. Res..

[41]  Martin W. P. Savelsbergh,et al.  Efficient feasibility testing for dial-a-ride problems , 2002, Oper. Res. Lett..

[42]  Lauri Häme,et al.  A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances , 2015, Transp. Sci..

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

[44]  Gilbert Laporte,et al.  The dynamic multiperiod vehicle routing problem with probabilistic information , 2014, Comput. Oper. Res..

[45]  Stefan Irnich,et al.  Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows , 2014, Oper. Res..

[46]  Maged M. Dessouky,et al.  An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..

[47]  Marco E. Lübbecke,et al.  Learning When to Use a Decomposition , 2017, CPAIOR.

[48]  Dimitris Bertsimas,et al.  Classification and Regression via Integer Optimization , 2007, Oper. Res..

[49]  Bülent Çatay,et al.  Partial recharge strategies for the electric vehicle routing problem with time windows , 2016 .

[50]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

[51]  Kris Braekers,et al.  A multi-period dial-a-ride problem with driver consistency , 2016 .

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

[53]  Bart Selman,et al.  Algorithm portfolios , 2001, Artif. Intell..

[54]  Tal Raviv,et al.  The locomotive fleet fueling problem , 2012, Oper. Res. Lett..

[55]  Kris Braekers,et al.  Typology and literature review for dial-a-ride problems , 2017, Ann. Oper. Res..

[56]  Warren B. Powell,et al.  Implementing Real-Time Optimization Models: A Case Application From The Motor Carrier Industry , 2002, Oper. Res..

[57]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..

[58]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[59]  J. Greenblatt,et al.  Autonomous taxis could greatly reduce greenhouse-gas emissions of US light-duty vehicles , 2015 .

[60]  Richard F. Hartl,et al.  Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports , 2011, Comput. Oper. Res..

[61]  Jens Lysgaard.  Reachability cuts for the vehicle routing problem with time windows , 2006, Eur. J. Oper. Res..

[62]  Nikolas Geroliminis,et al.  A Two Phase Heuristic Approach For The Dynamic Electric Autonomous Dial-a-Ride Problem , 2018 .

[63]  Konstantinos N. Genikomsakis,et al.  A computationally efficient simulation model for estimating energy consumption of electric vehicles in the context of route planning applications , 2017 .

[64]  K. Ruland,et al.  The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .

[65]  Robert B. Dial,et al.  Autonomous dial-a-ride transit introductory overview , 1995 .

[66]  Paul Shaw,et al.  A new local search algorithm providing high quality solutions to vehicle routing problems , 1997 .

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

[68]  Dimitris Bertsimas,et al.  Optimal classification trees , 2017, Machine Learning.

[69]  Gilbert Laporte,et al.  Battery degradation and behaviour for electric vehicles: Review and numerical analyses of several models , 2017 .

[70]  Stefan Irnich,et al.  Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem , 2015, Transp. Sci..

[71]  James Tanton.  The Law of Cosines , 2015 .

[72]  Gilbert Laporte,et al.  Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.

[73]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[74]  Oktay Günlük,et al.  Optimal Generalized Decision Trees via Integer Programming , 2016, ArXiv.

[75]  Daniele Vigo,et al.  Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs , 2009, Networks.

[76]  M. Grötschel,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000 .

[77]  Michel Gendreau,et al.  Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching , 2006, Transp. Sci..

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

[79]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[80]  Maximilian Schiffer,et al.  The electric location routing problem with time windows and partial recharging , 2017, Eur. J. Oper. Res..

[81]  Michel Gendreau,et al.  A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods , 2013, Eur. J. Oper. Res..

[82]  Giovanni Righini,et al.  A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges , 2014 .

[83]  Dominik Goeke,et al.  The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations , 2014, Transp. Sci..

[84]  Gilbert Laporte,et al.  50th Anniversary Invited Article - Goods Distribution with Electric Vehicles: Review and Research Perspectives , 2016, Transp. Sci..

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

[86]  Leo Breiman,et al.  Random Forests , 2001, Machine Learning.

[87]  Gilbert Laporte,et al.  Charge scheduling for electric freight vehicles , 2018, Transportation Research Part B: Methodological.

[88]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[89]  Andrea Lodi,et al.  On learning and branching: a survey , 2017 .

[90]  Maged Dessouky,et al.  A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .

[91]  Gábor Nagy,et al.  An efficient heuristic algorithm for the alternative-fuel station location problem , 2017, Eur. J. Oper. Res..

[92]  Gilles Pesant,et al.  Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming , 2011, Transp. Sci..

[93]  J. R. Jaramillo,et al.  The Green Vehicle Routing Problem , 2011 .

[94]  R. Cervero.  Paratransit in America: Redefining Mass Transportation , 1997 .

[95]  Alireza Talebpour,et al.  Influence of connected and autonomous vehicles on traffic flow stability and throughput , 2016 .