Dynamic programming based metaheuristics for the dial-a-ride problem

The organization of a specialized transportation system to perform transports for elderly and handicapped people is usually modeled as dial-a-ride problem. Users place transportation requests with specified pickup and delivery locations and times. The requests have to be completed under user inconvenience considerations by a specified fleet of vehicles. In the dial-a-ride problem, the aim is to minimize the total travel times respecting the given time windows, the maximum user ride times, and the vehicle restrictions. This paper introduces a dynamic programming algorithm for the dial-a-ride problem and demonstrates its effective application in (hybrid) metaheuristic approaches. Compared to most of the works presented in literature, this approach does not make use of any (commercial) solver. We present an exact dynamic programming algorithm and a dynamic programming based metaheuristic, which restricts the considered solution space. Then, we propose a hybrid metaheuristic algorithm which integrates the dynamic programming based algorithms into a large neighborhood framework. The algorithms are tested on a given set of benchmark instances from the literature and compared to a state-of-the-art hybrid large neighborhood search approach.

[1]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

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

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

[4]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

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

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

[7]  Russell Bent,et al.  A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2006, Comput. 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]  Michel Gendreau,et al.  Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography , 2008 .

[10]  BlumChristian,et al.  Hybrid metaheuristics in combinatorial optimization , 2011 .

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

[12]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[13]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[14]  Jakob Puchinger,et al.  Hybrid Metaheuristics for Dynamic and Stochastic Vehicle Routing , 2013, Hybrid Metaheuristics.

[15]  Peter Norvig,et al.  Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp , 1991 .

[16]  Naim Dahnoun,et al.  Studies in Computational Intelligence , 2013 .

[17]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[18]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

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

[20]  Vittorio Maniezzo,et al.  Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .

[21]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[22]  Richard F. Hartl,et al.  Demand Responsive Transportation , 2011 .

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

[24]  Principles and Practice of Constraint Programming — CP98 , 1999, Lecture Notes in Computer Science.

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

[26]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[27]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[28]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[29]  El-Ghazali Talbi.  Hybrid Metaheuristics , 2013, Hybrid Metaheuristics.

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

[31]  J. M. J. Schutten,et al.  Restricted dynamic programming: A flexible framework for solving realistic VRPs , 2012, Comput. Oper. Res..

[32]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..