Chapter

Algorithms and Data Structures

Volume 2748 of the series Lecture Notes in Computer Science pp 424-438

A Model for Analyzing Black-Box Optimization

  • Vinhthuy PhanAffiliated withComputer Science, SUNY at Stony Brook
  • , Steven SkienaAffiliated withComputer Science, State University of New York at Stony Brook
  • , Pavel SumazinAffiliated withComputer Science, Portland State University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The design of heuristics for NP-hard problems is perhaps the most active area of research in the theory of combinatorial algorithms. However, practitioners more often resort to local-improvement heuristics such as gradient-descent search, simulated annealing, tabu search, or genetic algorithms. Properly implemented, local-improvement heuristics can lead to short, efficient programs that yield reasonable solutions. Designers of efficient local-improvement heuristics must make several crucial decisions, including the choice of neighborhood and heuristic for the problem at hand. We are interested in developing a general methodology for predicting the quality of local-neighborhood operators and heuristics, given a time budget and a solution evaluation function.