G-2016-02
Variable neighborhood search: Basics and variants
, , , and BibTeX reference
Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a local minimum, and in a perturbation phase to emerge from the corresponding valley. In this paper we present some of VNS basic schemes as well as several VNS variants deduced from these basic schemes. In addition, our survey includes parallel implementations and hybrids with other metaheuristics.
Published January 2016 , 28 pages
Research Axes
Research applications
Publication
Sep 2017
, , , and
EURO Journal on Computational Optimization, 5(3), 423–454, 2017
BibTeX reference