Skip to Main content Skip to Navigation
Journal articles

Variable neighborhood search: basics and variants

Abstract : 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 escape 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, the paper includes parallel implementations and hybrids with other metaheuristics.
Document type :
Journal articles
Complete list of metadata
Contributor : Kathleen TORCK Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 11:48:14 AM
Last modification on : Wednesday, March 9, 2022 - 4:06:01 PM

Links full text




Pierre Hansen, Nenad Mladenovic, Raca Todosijević, Said Hanafi. Variable neighborhood search: basics and variants. EURO Journal on Computational Optimization, Springer, 2017, 5 (3), pp.423-454. ⟨10.1007/s13675-016-0075-x⟩. ⟨hal-03401113⟩



Record views