Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search

  • Authors:

  • Belarmino Adenso-Diaz;Manuel Laguna

  • Affiliations:

  • Escuela Superior de Ingenieros Industriales, Campus de Viesques, Universidad de Oviedo, 33204-Gijn, Spain;Leeds School of Business, University of Colorado, Boulder, Colorado 80309-0419

  • Venue:
  • Operations Research
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

Abstract

Researchers and practitioners frequently spend more time fine-tuning algorithms than designing and implementing them. This is particularly true when developing heuristics and metaheuristics, where the right choice of values for search parameters has a considerable effect on the performance of the procedure. When testing metaheuristics, performance typically is measured considering both the quality of the solutions obtained and the time needed to find them. In this paper, we describe the development of CALIBRA, a procedure that attempts to find the best values for up to five search parameters associated with a procedure under study. Because CALIBRA uses Taguchis fractional factorial experimental designs coupled with a local search procedure, the best values found are not guaranteed to be optimal. We test CALIBRA on six existing heuristic-based procedures. These experiments show that CALIBRA is able to find parameter values that either match or improve the performance of the procedures resulting from using the parameter values suggested by their developers. The latest version of CALIBRA can be downloaded for free from the website that appears in the online supplement of this paper at http://or.pubs.informs.org/Pages.collect.html.