An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem

This paper addresses the Dial-A-Ride Problem (DARP) which is used to model on-demand transportation services. This kind of transportation is quickly becoming an essential service for modern public mobility or logistics providers. In the DARP, a set of transportation requests has to be handled by a fleet of vehicles. Each request corresponds to a client to be transported from a pickup point to a delivery point. The routing costs have to be minimized, while respecting a set of constraints including time windows on nodes, maximum riding time per client and a maximal total duration of trips.An Evolutionary Local Search (ELS) based approach is proposed to solve this problem. A new greedy randomized heuristic to compute initial solutions is developed. A dynamic probabilities management mechanism is used in the local search to improve the convergence. The method is benchmarked on a classic set of instances from the literature and it is compared against state of the art methods. The numerical results show the effectiveness of this approach.

[1]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[2]  Michel Gendreau,et al.  Implicit depot assignments and rotations in vehicle routing heuristics , 2014, Eur. J. Oper. Res..

[3]  Paolo Toth,et al.  Fast Local Search Algorithms for the Handicapped Persons Transportation Problem , 1996 .

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

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

[6]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

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

[8]  Olli Bräysy,et al.  Active-guided evolution strategies for large-scale capacitated vehicle routing problems , 2007, Comput. Oper. Res..

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

[10]  Martin Grötschel,et al.  Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride System , 1999 .

[11]  Hussain Aziz Saleh,et al.  Handicapped Person Transportation: An application of the Grouping Genetic Algorithm , 2006, Eng. Appl. Artif. Intell..

[12]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[13]  Christian Prins,et al.  A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[14]  Oli B. G. Madsen,et al.  A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..

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

[16]  Steffen Wolf,et al.  Evolutionary Local Search for the Super-Peer Selection Problem and the p -Hub Median Problem , 2007, Hybrid Metaheuristics.

[17]  Gerhard J. Woeginger,et al.  Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh , 2011, Oper. Res. Lett..

[18]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

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

[20]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

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

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

[23]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[24]  D. T. Lee,et al.  An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications , 1993, Algorithmica.

[25]  Yuichi Nagata,et al.  Edge assembly-based memetic algorithm for the capacitated vehicle routing problem , 2009 .

[26]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[27]  Roberto Baldacci,et al.  A unified exact method for solving different classes of vehicle routing problems , 2009, Math. Program..

[28]  Philippe Lacomme,et al.  A memetic algorithm for the job-shop with time-lags , 2008, Comput. Oper. Res..