A Hybrid Greedy Randomized Adaptive Search Heuristic to Solve the Dial-a-Ride Problem

This paper presents a hybrid metaheuristic for solving the static dial-a-ride problem with heterogeneous vehicles and fixed costs. The hybridization combines a reactive greedy randomized adaptive search, used as outer scheme, with a tabu search heuristic in the local search phase. The algorithm is evaluated on well-known instances taken from the literature and on a set of randomly generated test problems, varying in the number of customers. Extensive computational results show the effectiveness of the hybrid approach in terms of trade-off between solution quality and computational time.

[1]  Jonathan F. Bard,et al.  Flight Scheduling and Maintenance Base Planning , 1989 .

[2]  Patrizia Beraldi,et al.  Designing robust routes for demand-responsive transport systems , 2014 .

[3]  Paolo Toth,et al.  Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..

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

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

[6]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[7]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[8]  Gilbert Laporte,et al.  Dynamic transportation of patients in hospitals , 2010, OR Spectr..

[9]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

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

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

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

[13]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

[14]  Mauricio G. C. Resende,et al.  Hybrid GRASP Heuristics , 2009, Foundations of Computational Intelligence.

[15]  Gilbert Laporte,et al.  The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.

[16]  Maged M. Dessouky,et al.  Hybrid scheduling methods for paratransit operations , 2003, Comput. Ind. Eng..

[17]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[18]  Michael G. H. Bell,et al.  Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints , 2006, Int. Trans. Oper. Res..

[19]  Jean-François Cordeau,et al.  Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints , 2012, OR Spectr..

[20]  Manuel Laguna,et al.  Tabu Search , 1997 .

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

[22]  Chengbin Chu,et al.  A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints , 2006, Eur. J. Oper. Res..

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

[24]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..

[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]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part Ii: Applications , 2022 .

[27]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[28]  Thomas Hanne,et al.  Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals , 2009, Interfaces.

[29]  Hokey Min,et al.  A dial-a-ride problem for client transportation in a health-care organization , 2007, Comput. Oper. Res..