Using Experimental Design to Find Effective Parameter Settings for Heuristics

In this paper, we propose a procedure, based on statistical design of experiments and gradient descent, that finds effective settings for parameters found in heuristics. We develop our procedure using four experiments. We use our procedure and a small subset of problems to find parameter settings for two new vehicle routing heuristics. We then set the parameters of each heuristic and solve 19 capacity-constrained and 15 capacity-constrained and route-length-constrained vehicle routing problems ranging in size from 50 to 483 customers. We conclude that our procedure is an effective method that deserves serious consideration by both researchers and operations research practitioners.

[1]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[2]  J. Morgan,et al.  Problems in the Analysis of Survey Data, and a Proposal , 1963 .

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

[4]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[5]  Bruce L. Golden,et al.  A Lagrangean relaxation heuristic for vehicle routing , 1984 .

[6]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

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

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

[9]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

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

[11]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

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

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

[14]  Mark E. Johnson,et al.  A case study in experimental design applied to genetic algorithms with applications to DNA sequence assembly , 1997 .

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

[16]  Yeong-Dae Kim,et al.  A systematic procedure for setting parameters in simulated annealing algorithms , 1998, Comput. Oper. Res..

[17]  Steve Y. Chiu,et al.  Fine-tuning a tabu search algorithm with statistical tests , 1998 .

[18]  Steven J. Robertson,et al.  Neural network models for initial public offerings , 1998, Neurocomputing.

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