论文信息 - Genetic Local Search for the Servers Load Balancing Problem

Genetic Local Search for the Servers Load Balancing Problem

In this work we consider the servers load balancing problem (SLBP) formulated as a mixed integer linear programming problem. As known, this problem is NP-hard in strong sense. We analyze the approximability of the problem and prove that SLBP is Log-APX-hard under PTAS-reducibility and cannot be NPO-complete unless P=NP. To solve the problem we develop an approximate method using the idea of genetic local search. Computational results are discussed.

[1] Y. Kochetov,et al. Comparison of metaheuristics for the bilevel facility location and mill pricing problem , 2015 .

[2] Y. Kochetov,et al. Genetic local search the graph partitioning problem under cardinality constraints , 2012 .

[3] Luca Trevisan,et al. Structure in Approximation Classes , 1999, Electron. Colloquium Comput. Complex..

[4] Vangelis Th. Paschos,et al. Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness , 2005, Theor. Comput. Sci..

[5] Vangelis Th. Paschos,et al. Completeness in approximation classes beyond APX , 2006, Theor. Comput. Sci..

[6] Julia V. Kovalenko,et al. OPTIMAL RECOMBINATION IN GENETIC ALGORITHMS FOR COMBINATORIAL OPTIMIYATION PROBLEMS – PART II , 2014 .

[7] Y. Kochetov,et al. Local search with an exponential neighborhood for the servers load balancing problem , 2015, Journal of Applied and Industrial Mathematics.

[8] Luca Trevisan,et al. On Approximation Scheme Preserving Reducibility and Its Applications , 2000, Theory Comput. Syst..

[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .