Variable Neighborhood Search (1997)
by
Pierre Hansen
,
Nenad Mladenovic
| Citations: | 151 - 13 self |
BibTeX
@MISC{Hansen97variableneighborhood,
author = {Pierre Hansen and Nenad Mladenovic},
title = {Variable Neighborhood Search},
year = {1997}
}
Years of Citing Articles
OpenURL
Abstract
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.







