Local search with a generalized neighborhood in the optimization problem for pseudo-Boolean functions
- 28 Downloads
In the optimization problem for pseudo-Boolean functions we consider a local search algorithm with a generalized neighborhood. This neighborhood is constructed for a locally optimal solution and includes nearby locally optimal solutions. We present some results of simulations for pseudo-Boolean functions whose optimization is equivalent to the problems of facility location, set covering, and competitive facility location. The goal of these experiments is to obtain a comparative estimate for the locally optimal solutions found by the standard local search algorithm and the local search algorithm using a generalized neighborhood.
Keywordsoptimization locally optimal solution pseudo-Boolean function facility location problem covering problem
Unable to display preview. Download preview PDF.
- 1.V. L. Beresnev, Discrete Location Problems and Polynomials in Boolean Variables (Inst. Mat., Novosibirsk, 2005) [in Russian].Google Scholar
- 3.V. L. Beresnevand A. A. Mel’nikov, “ApproximateAlgorithms for the Competitive Facility Location Problem,” Diskret. Anal. Issled. Oper. 17(6), 3–19 (2010) [J. Appl. Indust. Math. 5 (2), 180–190 (2011)].Google Scholar
- 6.J. E. Beasly, “OR-Library: Distributing Test Problems by Electronic Mail,” European J. Oper. Res. 41, 1069–1072 (1990).Google Scholar
- 10.P. L. Hammer and S. Rudeanu, Boolean Method in Operations Research and Related Areas (Springer, Berlin, 1968).Google Scholar
- 11.Local Search in Combinatorial Optimization (Wiley, Chichester, 1997).Google Scholar