Geodesic
Local search with exponential neighborhood for the servers load balancing problem
Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 6, pp. 21-34.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2014_21_6_a2,
     author = {I. A. Davydov and P. A. Kononova and Yu. A. Kochetov},
     title = {Local search with exponential neighborhood for the servers load balancing problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {21--34},
     publisher = {mathdoc},
     volume = {21},
     number = {6},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2014_21_6_a2/}
}
TY  - JOUR
AU  - I. A. Davydov
AU  - P. A. Kononova
AU  - Yu. A. Kochetov
TI  - Local search with exponential neighborhood for the servers load balancing problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2014
SP  - 21
EP  - 34
VL  - 21
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2014_21_6_a2/
LA  - ru
ID  - DA_2014_21_6_a2
ER  - 
%0 Journal Article
%A I. A. Davydov
%A P. A. Kononova
%A Yu. A. Kochetov
%T Local search with exponential neighborhood for the servers load balancing problem
%J Diskretnyj analiz i issledovanie operacij
%D 2014
%P 21-34
%V 21
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2014_21_6_a2/
%G ru
%F DA_2014_21_6_a2
I. A. Davydov; P. A. Kononova; Yu. A. Kochetov. Local search with exponential neighborhood for the servers load balancing problem. Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 6, pp. 21-34. http://geodesic.mathdoc.fr/item/DA_2014_21_6_a2/

[1] Beresnev V. L., Goncharov E. N., Melnikov A. A., “Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions”, J. Appl. Industr. Math., 6:1 (2012), 22–30 | DOI | MR | Zbl

[2] Davydov I., Kochetov Yu., Mladenovic N., Urosevich D., “Fast metaheuristics for the discrete $(r|p)$-centroid problem”, Autom. Remote Control, 75:4 (2014), 677–687 | DOI | Zbl

[3] Kononova P. A., Kochetov Yu. A., “The variable neighborhood search for the two machine flow shop problem with a passive prefetch”, J. Appl. Industr. Math., 7:1 (2013), 54–67 | DOI | MR

[4] Kochetov Yu. A., Kochetova N. A., “Zadacha balansirovki nagruzki na servery”, Vestn. Novosib. gos. un-ta. Ser. Inform. tekhnologii, 11:4 (2013), 71–76

[5] Melnikov A., “Randomized local search for the discrete competitive facility location problem”, Autom. Remote Control, 75:4 (2014), 700–714 | DOI | Zbl

[6] Ahuja R. K., Ergun O., Orlin J. B., Punnen A. P., “A survey of very large-scale neighborhood search techniques”, Discrete Appl. Math., 123:1–3 (2002), 75–102 | DOI | MR | Zbl

[7] Davydov I. A., Kochetov Yu. A., Carrizosa E., “A local search heuristic for the $(r|p)$-centroid problem in the plane”, Comput. Oper. Res., 52, Part B (2014), 334–340 | DOI | MR

[8] Gutin G., “Exponential neighborhood local search for the traveling salesman problem”, Comput. Oper. Res., 26 (1999), 313–320 | DOI | MR | Zbl

[9] Gutin G., Yeo A., “Small diameter neighborhood graphs for the traveling salesman problem: four moves from tour to tour”, Comput. Oper. Res., 26 (1999), 321–327 | DOI | MR | Zbl

[10] Hansen P., Mladenovich N., “Variable neighborhood search”, Eur. J. Oper. Res., 13 (2001), 449–467 | DOI | MR

[11] Kochetov Yu., Alekseeva E., Levanova T., Loresh M., “Large neighborhood local search for the $p$-median problem”, Yugoslav. J. Oper. Res., 15:1 (2005), 53–63 | DOI | MR | Zbl

[12] Kochetov Yu., Kononova P., Paschenko M., “Formulation space search approach for the teacher/class timetabling problem”, Yugoslav. J. Oper. Res., 18:1 (2008), 1–11 | DOI | MR

[13] Marti R., “Multi-start methods”, Handbook of metaheuristics, Kluwer Acad. Publ., Dordrecht, 2003, 355–368 | MR | Zbl

[14] Talbi E.-G., Metaheuristics: from design to implementation, Wiley, Berlin, 2009, 624 pp. | Zbl

[15] Yannakakis M., “Computational complexity”, Local search in combinatorial optimization, Wiley, Chichester, 1997, 19–55 | MR | Zbl