Open Access
Open access
EURO Journal on Computational Optimization, volume 5, issue 3, pages 423-454

Variable neighborhood search: basics and variants

PIERRE HANSEN 1
N. Mladenovic 2
Raca Todosijevic 2
Saïd Hanafi 2
1
 
GERAD and HEC Montréal, Montreal, Canada
2
 
LAMIH-UVHC, CNRS UMR 8201, Valenciennes Cedex 9, France
Publication typeJournal Article
Publication date2017-09-01
scimago Q1
SJR0.983
CiteScore3.5
Impact factor2.6
ISSN21924406, 21924414
Computational Mathematics
Control and Optimization
Modeling and Simulation
Management Science and Operations Research
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.
Found 
Found 

Top-30

Journals

5
10
15
20
25
30
35
40
5
10
15
20
25
30
35
40

Publishers

20
40
60
80
100
120
20
40
60
80
100
120
  • We do not take into account publications without a DOI.
  • Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
  • Statistics recalculated weekly.

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.
Share
Cite this
GOST | RIS | BibTex | MLA
Found error?