RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2014 Volume 21, Issue 6, Pages 21–34 (Mi da799)

This article is cited in 5 papers

Local search with exponential neighborhood for the servers load balancing problem

I. A. Davydovab, P. A. Kononovaba, Yu. A. Kochetovba

a S. L. Sobolev Institute of Mathematics, SB RAS, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia

Abstract: For the servers load balancing problem, we present a local search method with a new exponential neighborhood. We study variants of the local search algorithms with randomized versions of the neighborhood. Computational results confirm high efficiency of the proposed approach. Ill. 1, tab. 4, bibliogr. 15.

Keywords: local search, assignment problem, load balancing.

UDC: 519.87

Received: 11.04.2014
Revised: 22.05.2014


 English version:
Journal of Applied and Industrial Mathematics, 2015, 9:1, 27–35

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024