zbMATH — the first resource for mathematics

Variable neighborhood search. (English) Zbl 1102.90371
Glover, Fred (ed.) et al., Handbook of metaheuristics. Boston, MA: Kluwer Academic Publishers (ISBN 1-4020-7263-5/hbk). Int. Ser. Oper. Res. Manag. Sci. 57, 145-184 (2003).
Summary: Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications are briefly summarized. They comprise heuristic solution of a variety of optimization problems, ways to accelerate exact algorithms and to analyze heuristic solution processes, as well as computer-assisted discovery of conjectures in graph theory.
For the entire collection see [Zbl 1058.90002].

90C30 Nonlinear programming
90B40 Search theory
90C59 Approximation methods and heuristics in mathematical programming
Full Text: DOI