|
Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 4, Pages 3–16
(Mi da657)
|
|
|
|
This article is cited in 9 scientific papers (total in 9 papers)
Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions
V. L. Beresnevab, E. N. Goncharovab, A. A. Mel'nikovb a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
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. 11.
Keywords:
optimization, local search, polynomial of Boolean variables, facility location problem, set coverage problem.
Received: 04.04.2011
Citation:
V. L. Beresnev, E. N. Goncharov, A. A. Mel'nikov, “Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions”, Diskretn. Anal. Issled. Oper., 18:4 (2011), 3–16; J. Appl. Industr. Math., 6:1 (2012), 22–30
Linking options:
https://www.mathnet.ru/eng/da657 https://www.mathnet.ru/eng/da/v18/i4/p3
|
Statistics & downloads: |
Abstract page: | 554 | Full-text PDF : | 121 | References: | 45 | First page: | 4 |
|