Scatter search for the vehicle routing problem with time windows

In this paper we use a scatter search framework to solve the vehicle routing problem with time windows (VRPTW). Our objective is to achieve effective solutions and to investigate the effects of reference set design parameters pertaining to size, quality and diversity. Both a common arc method and an optimization-based set covering model are used to combine vehicle routing solutions. A reactive tabu search metaheuristic and a tabu search with an advanced recovery feature, together with a set covering procedure are used for solution improvement. Our approach led to a robust solution method, generating solution quality that is competitive with the current best metaheuristics.

[1]  David Simchi-Levi,et al.  The logic of logistics , 1997 .

[2]  José Luis González Velarde,et al.  Computing tools for modeling, optimization and simulation : interfaces in computer science and operations research , 2000 .

[3]  V. Cung,et al.  A scatter search based approach for the quadratic assignment problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[4]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[5]  Jean-Yves Potvin,et al.  The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..

[6]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[7]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..

[8]  Ángel Corberán,et al.  Heuristic solutions to the problem of routing school buses with multiple objectives , 2002, J. Oper. Res. Soc..

[9]  M. Laguna,et al.  Scatter search for the linear ordering problem , 1999 .

[10]  Jiefeng Xu,et al.  Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search , 1999 .

[11]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

[12]  Rafael Martí,et al.  Context-Independent Scatter and Tabu Search for Permutation Problems , 2005, INFORMS J. Comput..

[13]  David L. Woodruff,et al.  Scatter Search to Generate Diverse MIP Solutions , 2000 .

[14]  Jeffrey L. Rummel,et al.  A Subpath Ejection Method for the Vehicle Routing Problem , 1998 .

[15]  S. Salhi,et al.  Local Search Strategies for the Vehicle Fleet Mix Problem , 1996 .

[16]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[17]  Wen-Chyuan Chiang,et al.  A metaheuristic for the vehicle-routeing problem with soft time windows , 2004, J. Oper. Res. Soc..

[18]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[19]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[20]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[21]  Peter Greistorfer,et al.  A Tabu Scatter Search Metaheuristic for the Arc Routing Problem , 2002 .

[22]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[23]  Jörg Homberger,et al.  Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows , 2002, J. Heuristics.

[24]  F. Glover.  Scatter search and path relinking , 1999 .

[25]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

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

[27]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[28]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[29]  Jin-Kao Hao,et al.  Scatter Search for Graph Coloring , 2001, Artificial Evolution.

[30]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[31]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

[32]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

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

[34]  Sheik Meeran,et al.  A multi-level hybrid framework applied to the general flow-shop scheduling problem , 2002, Comput. Oper. Res..

[35]  Fred Glover,et al.  Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.

[36]  David Ronen.  Scheduling charter aircraft , 2000, J. Oper. Res. Soc..

[37]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..