Substructural Neighborhoods for Local Search in the Bayesian Optimization Algorithm

Cláudio F. Lima, Martin Pelikan, Kumara Sastry, Martin V. Butz, David E. Goldberg, Fernando G. Lobo

Abstract

This paper studies the utility of using substructural neighborhoods for local search in the Bayesian optimization algorithm (BOA). The probabilistic model of BOA, which automatically identifies important problem substructures, is used to define the structure of the neighborhoods used in local search. Additionally, a surrogate fitness model is considered to evaluate the improvement of the local search steps. The results show that performing substructural local search in BOA significatively reduces the number of generations necessary to converge to optimal solutions and thus provides substantial speedups.
BibTeX
@inproceedings{lima2006substructural,
  author = {Cláudio F. Lima and Martin Pelikan and Kumara Sastry and Martin V. Butz and David E. Goldberg and Fernando G. Lobo},
  title = {{Substructural Neighborhoods for Local Search in the Bayesian Optimization Algorithm}},
  booktitle = {PPSN},
  year = {2006},
  doi = {10.1007/11844297\_24},
}

Loading related content...

Figure