Volume 18, No 4, 2011, P. 3-16

UDC 519.8
V. L. Beresnev, E. N. Goncharov, A. A. Melnikov
Local search over generalized neighborhood for an optimization problem of pseudo-boolean functions

We consider an algorithm for local search with generalized neighborhood for a pseudo-Boolean function optimization problem. A generalized neighborhood is constructed for locally optimal solutions that contains other locally optimal solutions which surround the former. We bring results of numerical experiments with usage of pseudo-Boolean functions whose optimization is equivalent to problems of facility location, set coverage, and competitive facility location. The aim of experiments is comparative estimating of locally optimal solutions obtained with the common local search algorithm and the algorithm of local search with generalized neighborhood.
Tabl. 6, bibliogr. 15.

Keywords: optimization, local search, polynomial of Boolean variables, facility location problem, set coverage problem.

Beresnev Vladimir Leonidovich 1,2
Goncharov Evgenii Nikolaevich 1,2

Mel'nikov Andrey Andreevich 2
1. S. L. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
2. Novosibirsk State University,
2 Pirogov St., 630090 Novosibirsk, Russia
e-mail: beresnev@math.nsc.ru, goncharov@math.nsc.ru, a.a.melnikov@hotmail.com

 © Sobolev Institute of Mathematics, 2015