Experience with a framework for developing heuristics for solving rich vehicle routing problems

According to Cordeau et al. (J Oper Res Soc 53(5):512–522, 2002) a good VRP heuristic should fulfill four criteria: accuracy, speed, simplicity, and flexibility. In this paper we report experience with a heuristic framework for solving rich vehicle routing problems (RVRP), which is based on rather simple heuristics. This heuristic framework has been implemented as flexible software framework. The user-friendly design enables flexible customization of problem-specific solvers. Our computational study on five RVRP reveals that the heuristic approach is rather robust with respect to parameterization and that the solvers which have been customized from the framework can compete with state-of-the-art special purpose developments.

[1]  Michel Gendreau,et al.  Metaheuristics in Vehicle Routing , 2012, International Conference on Operations Research and Enterprise Systems.

[2]  Geir Hasle,et al.  Industrial Vehicle Routing , 2007, Geometric Modelling, Numerical Simulation, and Optimization.

[3]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[4]  Abdellah El-Fallahi,et al.  A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..

[5]  Martin W. P. Savelsbergh,et al.  Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems , 2004, Transp. Sci..

[6]  Martin W. P. Savelsbergh,et al.  An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem , 2008, Transp. Sci..

[7]  Kenneth Sörensen,et al.  "Multiple Neighbourhood" Search in Commercial VRP Packages: Evolving Towards Self-Adaptive Methods , 2008, Adaptive and Multilevel Metaheuristics.

[8]  G. Dueck.  New optimization heuristics , 1993 .

[9]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[10]  Ulrich Derigs,et al.  Indirect search for the vehicle routing problem with pickup and delivery and time windows , 2008, OR Spectr..

[11]  Ulrich Derigs,et al.  Applying the attribute based hill climber heuristic to the vehicle routing problem , 2007, Eur. J. Oper. Res..

[12]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[13]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[14]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[15]  George D. Smith,et al.  The Attribute Based Hill Climber , 2004, J. Math. Model. Algorithms.

[16]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[17]  Stefan Irnich,et al.  A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics , 2008, INFORMS J. Comput..

[18]  Richard F. Hartl,et al.  A variable neighborhood search heuristic for periodic routing problems , 2009, Eur. J. Oper. Res..

[19]  Luc Muyldermans,et al.  On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm , 2010, Eur. J. Oper. Res..

[20]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

[21]  Michel Gendreau,et al.  A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..

[22]  I-Ming Chao,et al.  A tabu search method for the truck and trailer routing problem , 2002, Comput. Oper. Res..

[23]  David L. Woodruff,et al.  Optimization software class libraries , 2002 .

[24]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[25]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[26]  Russell Bent,et al.  A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..

[27]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

[28]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[29]  Ulrich Derigs,et al.  Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints : an application to road feeder service planning in air cargo transportation , 2009, OR Spectr..

[30]  Michael Drexl,et al.  Rich vehicle routing in theory and practice , 2012, Logist. Res..

[31]  DerigsUlrich,et al.  Vehicle routing with compartments , 2011 .

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

[33]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[34]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[35]  Franz Rothlauf,et al.  Vehicle routing with compartments: applications, modelling and heuristics , 2011, OR Spectr..

[36]  Ulrich Derigs,et al.  Local search-based metaheuristics for the split delivery vehicle routing problem , 2010, J. Oper. Res. Soc..

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

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

[39]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[40]  Ulrich Vogel,et al.  A flexible metaheuristic framework for solving rich vehicle routing problems: Formulierung, Implementierung und Anwendung eines kognitionsbasierten Simulationsmodells , 2011 .

[41]  Nubia Velasco,et al.  A GRASP with evolutionary path relinking for the truck and trailer routing problem , 2011, Comput. Oper. Res..

[42]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[43]  Bruce L. Golden,et al.  A library of local search heuristics for the vehicle routing problem , 2010, Math. Program. Comput..

[44]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[45]  Shuo-Yan Chou,et al.  Solving the truck and trailer routing problem based on a simulated annealing heuristic , 2009, Comput. Oper. Res..