An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic

The Vehicle Routing Problem is a well-studied problem. Since its formulation in 1959, a great number of powerful solution methods have been designed. However, for large scale problems, few techniques are able to consistently find good solutions within an acceptable time limit. In this paper, the concept of Static Move Descriptors, a recently published technique for speeding up Local Search algorithms, is analyzed and an efficient implementation is suggested. We describe several changes that significantly improve the performance of an SMD-based Local Search algorithm. The result is an efficient and flexible technique that can easily be adapted to different metaheuristics and can be combined with other complexity reduction strategies.

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

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

[3]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..

[4]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[5]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

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

[7]  Yuichi Nagata,et al.  Efficient Local Search Limitation Strategies for Vehicle Routing Problems , 2008, EvoCOP.

[8]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

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

[10]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[11]  Donald B. Johnson,et al.  Priority Queues with Update and Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

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

[13]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

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

[15]  Patrick Prosser,et al.  Guided Local Search for the Vehicle Routing Problem , 1997 .

[16]  Shih-Wei Lin,et al.  An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem , 2010, Applied Intelligence.

[17]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[18]  Jon Louis Bentley,et al.  Experiments on traveling salesman heuristics , 1990, SODA '90.

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

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

[21]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

[23]  Michael Rubinovitch.  A Probabilistic Model for Optimal Project Scheduling , 1972, Oper. Res..

[24]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[25]  Tore Grünert,et al.  Sequential search and its application to vehicle-routing problems , 2006, Comput. Oper. Res..

[26]  César Rego,et al.  Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms , 2001, Parallel Comput..

[27]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[28]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[29]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

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

[31]  Jean Vuillemin,et al.  A data structure for manipulating priority queues , 1978, CACM.

[32]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[33]  Wei Tu,et al.  A Voronoi neighborhood-based search heuristic for distance/capacity constrained very large vehicle routing problems , 2013, Int. J. Geogr. Inf. Sci..

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

[35]  Bruce L. Golden,et al.  Very large-scale vehicle routing: new test problems, algorithms, and results , 2005, Comput. Oper. Res..

[36]  Moritoshi Yasunaga,et al.  Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[38]  E. Tsang,et al.  Guided Local Search , 2010 .

[39]  Thibaut Vidal,et al.  New benchmark instances for the Capacitated Vehicle Routing Problem , 2017, Eur. J. Oper. Res..

[40]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .