A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem

[1]  Gilbert Laporte,et al.  The static bike relocation problem with multiple vehicles and visits , 2018, Eur. J. Oper. Res..

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

[3]  Michel Gendreau,et al.  A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..

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

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

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

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

[8]  David Pisinger,et al.  Synchronized dial-a-ride transportation of disabled passengers at airports , 2013, Eur. J. Oper. Res..

[9]  David B. Shmoys,et al.  Mathematical Programming Guides Air-Ambulance Routing at Ornge , 2013, Interfaces.

[10]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[11]  Paolo Detti,et al.  A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare☆ , 2017 .

[12]  Timo Gschwind,et al.  Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem , 2019, Transp. Sci..

[13]  Jacques Desrosiers,et al.  Large Scale Multi-Vehicle Dial-a-Ride Problems , 1989 .

[14]  Antonio LaTorre,et al.  A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city , 2013, Expert Syst. Appl..

[15]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .

[16]  Kris Braekers,et al.  Benefits of horizontal cooperation in dial-a-ride services , 2017 .

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

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

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

[20]  Kris Braekers,et al.  A hybrid Genetic Algorithm for the Heterogeneous Dial-A-Ride Problem , 2017, Comput. Oper. Res..

[21]  Anand Subramanian,et al.  A hybrid algorithm for a class of vehicle routing problems , 2013, Comput. Oper. Res..

[22]  W. Y. Szeto,et al.  A survey of dial-a-ride problems: Literature review and recent developments , 2018 .

[23]  John R. Hauser,et al.  ADVANCED DIAL-A-RIDE ALGORITHMS RESEARCH PROJECT , 1976 .

[24]  Daniele Vigo,et al.  An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic , 2018, ICORES.

[25]  Erwin Pesch,et al.  Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem , 2019, J. Heuristics.

[26]  H. Psaraftis.  An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

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

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

[29]  Jacques Desrosiers,et al.  THE MULTIPLE VEHICLE DIAL-A-RIDE PROBLEM , 1988 .

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

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

[32]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

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

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

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

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

[37]  Jacques Desrosiers,et al.  A Request Clustering Algorithm for Door-to-Door Handicapped Transportation , 1991, Transp. Sci..

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

[39]  Arnaud Liefooghe,et al.  Solving a dial-a-ride problem with a hybrid evolutionary multi-objective approach: Application to demand responsive transport , 2012, Appl. Soft Comput..

[40]  Emmanouil E. Zachariadis,et al.  A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem , 2010, Comput. Oper. Res..

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

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

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

[44]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.