Sciact
  • EN
  • RU

Local search with a generalized neighborhood in the optimization problem for pseudo-Boolean functions Full article

Journal Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797
Output data Year: 2012, Volume: 6, Number: 1, Pages: 22-30 Pages count : 9 DOI: 10.1134/s1990478912010048
Tags covering problem; facility location problem; locally optimal solution; optimization; pseudo-Boolean function
Authors Beresnev V.L. 1 , Goncharov E.N. 1 , Mel’nikov A.A. 1
Affiliations
1 Sobolev Institute of Mathematics

Abstract: 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.
Cite: Beresnev V.L. , Goncharov E.N. , Mel’nikov A.A.
Local search with a generalized neighborhood in the optimization problem for pseudo-Boolean functions
Journal of Applied and Industrial Mathematics. 2012. V.6. N1. P.22-30. DOI: 10.1134/s1990478912010048 Scopus OpenAlex
Original: Береснев В.Л. , Гончаров Е.Н. , Мельников А.А.
Локальный поиск по обобщенной окрестности для оптимизации псевдобулевых функций
Дискретный анализ и исследование операций. 2011. Т.18. №4. С.3-16.
Dates:
Submitted: Apr 4, 2011
Published print: Feb 28, 2012
Identifiers:
Scopus: 2-s2.0-84857679640
OpenAlex: W2021333602
Citing:
DB Citing
Scopus 4
OpenAlex 6
Altmetrics: