Standard

Local search for load balancing problems for servers with large dimension. / Davydov, I. A.; Melnikov, A. A.; Kononova, P. A.

In: Automation and Remote Control, Vol. 78, No. 3, 01.03.2017, p. 412-424.

Research output: Contribution to journal › Article › peer-review

Harvard

Davydov, IA, Melnikov, AA & Kononova, PA 2017, 'Local search for load balancing problems for servers with large dimension', Automation and Remote Control, vol. 78, no. 3, pp. 412-424. https://doi.org/10.1134/S0005117917030031

APA

Davydov, I. A., Melnikov, A. A., & Kononova, P. A. (2017). Local search for load balancing problems for servers with large dimension. Automation and Remote Control, 78(3), 412-424. https://doi.org/10.1134/S0005117917030031

Vancouver

Davydov IA, Melnikov AA, Kononova PA. Local search for load balancing problems for servers with large dimension. Automation and Remote Control. 2017 Mar 1;78(3):412-424. doi: 10.1134/S0005117917030031

Author

Davydov, I. A. ; Melnikov, A. A. ; Kononova, P. A. / Local search for load balancing problems for servers with large dimension. In: Automation and Remote Control. 2017 ; Vol. 78, No. 3. pp. 412-424.

BibTeX

@article{6fc75f299dbd46809cda16790967a757,
title = "Local search for load balancing problems for servers with large dimension",
abstract = "We consider a new load balancing model that arises in the processing of user requests for files located on a given set of servers. The optimization criterion is the total excess of actual load over the limit load. In order to redistribute the load and minimize the criterion, files can be moved between the servers. We show that if there are no other constraints related to the stage of moving the files, then this problem is equivalent to a problem previously considered in literature. For this special case of this problem, we propose a stochastic local search scheme that combines a special procedure for fast querying of the neighborhoods and a procedure of non-aggravating modification of intermediate solutions. Results of numerical experiments show that the proposed approach is able to find high-quality solutions for instances of large dimension under tight time constraints.",
keywords = "combinatorial optimization, packing problems, randomized neighborhood, stochastic local search",
author = "Davydov, {I. A.} and Melnikov, {A. A.} and Kononova, {P. A.}",
year = "2017",
month = mar,
day = "1",
doi = "10.1134/S0005117917030031",
language = "English",
volume = "78",
pages = "412--424",
journal = "Automation and Remote Control",
issn = "0005-1179",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "3",

}

RIS

TY - JOUR

T1 - Local search for load balancing problems for servers with large dimension

AU - Davydov, I. A.

AU - Melnikov, A. A.

AU - Kononova, P. A.

PY - 2017/3/1

Y1 - 2017/3/1

N2 - We consider a new load balancing model that arises in the processing of user requests for files located on a given set of servers. The optimization criterion is the total excess of actual load over the limit load. In order to redistribute the load and minimize the criterion, files can be moved between the servers. We show that if there are no other constraints related to the stage of moving the files, then this problem is equivalent to a problem previously considered in literature. For this special case of this problem, we propose a stochastic local search scheme that combines a special procedure for fast querying of the neighborhoods and a procedure of non-aggravating modification of intermediate solutions. Results of numerical experiments show that the proposed approach is able to find high-quality solutions for instances of large dimension under tight time constraints.

AB - We consider a new load balancing model that arises in the processing of user requests for files located on a given set of servers. The optimization criterion is the total excess of actual load over the limit load. In order to redistribute the load and minimize the criterion, files can be moved between the servers. We show that if there are no other constraints related to the stage of moving the files, then this problem is equivalent to a problem previously considered in literature. For this special case of this problem, we propose a stochastic local search scheme that combines a special procedure for fast querying of the neighborhoods and a procedure of non-aggravating modification of intermediate solutions. Results of numerical experiments show that the proposed approach is able to find high-quality solutions for instances of large dimension under tight time constraints.

KW - combinatorial optimization

KW - packing problems

KW - randomized neighborhood

KW - stochastic local search

UR - http://www.scopus.com/inward/record.url?scp=85014951422&partnerID=8YFLogxK

U2 - 10.1134/S0005117917030031

DO - 10.1134/S0005117917030031

M3 - Article

AN - SCOPUS:85014951422

VL - 78

SP - 412

EP - 424

JO - Automation and Remote Control

JF - Automation and Remote Control

SN - 0005-1179

IS - 3

ER -

ID: 9028907