An Investigation on Compound Neighborhoods for VRPTW

The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time intervals and capacity constraints. A Variable Neighbourhood Search algorithm which can simultaneously optimize both objectives of VRPTW (to minimize the number of vehicles and the total travel distance) is proposed in this paper. The three compound neighbourhood operators are developed with regards to problem characteristics of VRPTW. Compound neighbourhoods combine a number of independent neighbourhood operators to explore a larger scale of neighbourhood search space. Performance of these operators has been investigated and is evaluated on benchmark problems.

[1]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[2]  Nursel Öztürk,et al.  An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows , 2015, Comput. Ind. Eng..

[3]  James B. Orlin,et al.  Creating very large scale neighborhoods out of smaller ones by compounding moves , 2006, J. Heuristics.

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

[5]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[6]  Nicolas Jozefowiez,et al.  Multi-objective vehicle routing problems , 2008, Eur. J. Oper. Res..

[7]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[8]  Pierre Hansen,et al.  J-MEANS: a new local search heuristic for minimum sum of squares clustering , 1999, Pattern Recognit..

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

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

[11]  Ziauddin Ursani,et al.  Localized genetic algorithm for vehicle routing problem with time windows , 2011, Appl. Soft Comput..

[12]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[13]  Kay Chen Tan,et al.  A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows , 2003, Comput. Optim. Appl..

[14]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

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

[16]  Beatrice M. Ombuki-Berman,et al.  Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows , 2006, Applied Intelligence.

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

[18]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

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

[20]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[21]  Keivan Ghoseiri,et al.  Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm , 2010, Appl. Soft Comput..

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

[23]  Alex Van Breedam,et al.  Improvement heuristics for the Vehicle Routing Problem based on simulated annealing , 1995 .

[24]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

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

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

[27]  Pierre Hansen,et al.  Variable neighborhood search and local branching , 2004, Comput. Oper. Res..

[28]  Brian Kallehauge,et al.  Lagrangian duality applied to the vehicle routing problem with time windows , 2006, Comput. Oper. Res..

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

[30]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

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