A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows

The paper presents an efficient Hybrid Genetic Search with Advanced Diversity Control for a large class of time-constrained vehicle routing problems, introducing several new features to manage the temporal dimension. New move evaluation techniques are proposed, accounting for penalized infeasible solutions with respect to time-window and duration constraints, and allowing to evaluate moves from any classical neighbourhood based on arc or node exchanges in amortized constant time. Furthermore, geometric and structural problem decompositions are developed to address efficiently large problems. The proposed algorithm outperforms all current state-of-the-art approaches on classical literature benchmark instances for any combination of periodic, multi-depot, site-dependent, and duration-constrained vehicle routing problem with time windows.

[1]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[2]  Russell Bent,et al.  Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows , 2010, CP.

[3]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[4]  Feng Chu,et al.  A Scatter Search for the periodic capacitated arc routing problem , 2006, Eur. J. Oper. Res..

[5]  Michel Gendreau,et al.  Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography , 2008 .

[6]  Bin Yu,et al.  An ant colony optimization model: The period vehicle routing problem with time windows , 2011 .

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

[8]  Gilbert Laporte,et al.  Solving a vehicle-routing problem arising in soft-drink distribution , 2006, J. Oper. Res. Soc..

[9]  Günther R. Raidl,et al.  Matheuristics for the Periodic Vehicle Routing Problem with Time Windows , 2010 .

[10]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

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

[12]  Günther R. Raidl,et al.  Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows , 2009, Hybrid Metaheuristics.

[13]  Gilbert Laporte,et al.  Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows , 2004, J. Oper. Res. Soc..

[14]  Bruce L. Golden,et al.  OR Practice - Computerized Vehicle Routing in the Soft Drink Industry , 1987, Oper. Res..

[15]  Alexander Popov,et al.  Routing Optimization for Waste Management , 2005, Interfaces.

[16]  António Pais Antunes,et al.  Recyclable waste collection planning--a case study , 2004, Eur. J. Oper. Res..

[17]  Richard F. Hartl,et al.  A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[18]  Toshihide Ibaraki,et al.  An iterated local search algorithm for the vehicle routing problem with convex time penalty functions , 2008, Discret. Appl. Math..

[19]  Fred W. Glover,et al.  The case for strategic oscillation , 2011, Ann. Oper. Res..

[20]  Buyang Cao,et al.  Applying GIS and OR Techniques to Solve Sears Technician-Dispatching and Home Delivery Problems , 1999, Interfaces.

[21]  Slim Belhaiza.  New Hybrid Variable Neighborhood-Tabu Search Metaheuristic for the Site Dependent Vehicle Routing Problem , 2010 .

[22]  Nacima Labadie,et al.  A memetic algorithm for the vehicle routing problem with time windows , 2008, RAIRO Oper. Res..

[23]  Christian Prins,et al.  Two memetic algorithms for heterogeneous fleet vehicle routing problems , 2009, Eng. Appl. Artif. Intell..

[24]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009, Networks.

[25]  Gilbert Laporte,et al.  A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows , 2001 .

[26]  Christos D. Tarantilis,et al.  Arc-Guided Evolutionary Algorithm for the Vehicle Routing Problem With Time Windows , 2009, IEEE Transactions on Evolutionary Computation.

[27]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[28]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[29]  Geraldo Robson Mateus,et al.  A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows , 2007, Comput. Oper. Res..

[30]  Toshihide Ibaraki,et al.  Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints , 2005, Transp. Sci..

[31]  Richard F. Hartl,et al.  A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2008 .

[32]  Olli Bräysy,et al.  Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..

[33]  Thomas J. Crowe,et al.  The Missouri Lottery Optimizes Its Scheduling and Routing to Improve Efficiency and Balance , 2006, Interfaces.

[34]  Jean-François Cordeau,et al.  A parallel iterated tabu search heuristic for vehicle routing problems , 2012, Comput. Oper. Res..

[35]  M. Gendreau.  A Hybrid Genetic Algorithm for Multi-Depot and Periodic Vehicle Routing Problems , 2010 .

[36]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[37]  Michel Gendreau,et al.  Multi-thread integrative cooperative optimization for rich combinatorial problems , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[38]  Huan Neng Chiu,et al.  Two approaches to solving the multi-depot vehicle routing problem with time windows in a time-based logistics environment , 2006 .

[39]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

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

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

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

[43]  Teodor Gabriel Crainic,et al.  A guided cooperative search for the vehicle routing problem with time windows , 2005, IEEE Intelligent Systems.

[44]  Hideki Hashimoto,et al.  An iterated local search algorithm for the time-dependent vehicle routing problem with time windows , 2008, Discret. Optim..

[45]  Rasaratnam Logendran,et al.  Periodic product distribution from multi-depots under limited supplies , 2006 .

[46]  Christos D. Tarantilis,et al.  Solving Large-Scale Vehicle Routing Problems with Time Windows: The State-of-the-Art , 2010 .

[47]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[48]  Buyang Cao,et al.  Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Optimizing Periodic Maintenance Operations for Schindler Elevator Corporation , 2003, Interfaces.

[49]  Michal Tzur,et al.  The Period Vehicle Routing Problem and its Extensions , 2008 .

[50]  Teodor Gabriel Crainic,et al.  A cooperative parallel meta-heuristic for the vehicle routing problem with time windows , 2005, Comput. Oper. Res..

[51]  Teodor Gabriel Crainic,et al.  A Hybrid Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows , 2011 .

[52]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[53]  BräysyOlli,et al.  Vehicle Routing Problem with Time Windows, Part II , 2005 .

[54]  Jacques Desrosiers,et al.  Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .

[55]  Morikazu Nakamura,et al.  A Tabu Search Approach combined with An Extended Saving Me- thod for Multi-depot Vehicle Routing Problems with Time Windows , 2010 .

[56]  Hermann Gehring,et al.  A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .

[57]  Wout Dullaert,et al.  A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

[58]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[59]  Gerrit K. Janssens,et al.  Special issue on Rich Vehicle Routing Problems , 2006, Central Eur. J. Oper. Res..

[60]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[61]  Yuichi Nagata,et al.  A powerful route minimization heuristic for the vehicle routing problem with time windows , 2009, Oper. Res. Lett..

[62]  Andrew Lim,et al.  A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows , 2007, INFORMS J. Comput..

[63]  Alexander Ostertag,et al.  Decomposition strategies for large scale multi depot vehicle routing problems , 2008 .

[64]  G. Raidl,et al.  A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows , 2008 .

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