×

zbMATH — the first resource for mathematics

Local search over a generalized neighborhood for an optimization problem of pseudo-Boolean functions. (Russian) Zbl 1249.90137
Summary: We consider an algorithm for local search with a generalized neighborhood for an optimization problem of a pseudo-Boolean function. The generalized neighborhood is constructed in order to obtain locally optimal solutions; it contains other locally optimal solutions which ‘surround’ the initial locally optimal solution. We present results of numerical experiments using pseudo-Boolean functions whose optimization is equivalent to the problems of facility location, set coverage, and competitive facility location. The aim of the experiments is a comparative estimation of the locally optimal solutions obtained with the help of a common local search algorithm and the algorithm of local search with a generalized neighborhood.

MSC:
90B80 Discrete location and assignment
PDF BibTeX XML Cite