Authors: Hansen, Pierre
Mladenović, Nenad 
Todosijević, Raca 
Hanafi, Saïd
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Variable neighborhood search: basics and variants
Journal: EURO Journal on Computational Optimization
Volume: 5
Issue: 3
First page: 423
Last page: 454
Issue Date: 1-Sep-2017
ISSN: 2192-4406
DOI: 10.1007/s13675-016-0075-x
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.
Keywords: Heuristic | Metaheuristic | Variable neighborhood search
Publisher: Springer Link

Show full item record

SCOPUSTM   
Citations

102
checked on Apr 14, 2021

Page view(s)

10
checked on Apr 15, 2021

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.