VNS-based heuristic with an exponential neighborhood for the server load balancing problem

DOI10.1016/j.endm.2014.11.008zbMath1362.68019OpenAlexW2049465947MaRDI QIDQ2631229

Yanyan Li

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.008

zbMATH Keywords

metaheuristicassignment problemvariable neighborhoodlarge neighborhood

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Internet topics (68M11)

Related Items (1)

Local search for load balancing problems for servers with large dimension

Cites Work

• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• Randomized local search for the discrete competitive facility location problem
• A survey of very large-scale neighborhood search techniques
• Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I
• Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
• Large neighborhood local search for the p-median problem
• Variable neighborhood search: Principles and applications

This page was built for publication: VNS-based heuristic with an exponential neighborhood for the server load balancing problem