Skip to search formSkip to main contentSkip to account menu

Variable neighborhood search

Known as: VNS, Variable Neighbourhood Search 
Variable neighborhood search (VNS), proposed by Mladenović, Hansen, 1997, is a metaheuristic method for solving a set of combinatorial optimization… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper the location and design problem is considered. The point of this is that a Company is going to open markets to… 
2013
2013
We analyze five parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic. They are based on… 
2012
2012
The corridor allocation problem is one of assigning a given set of facilities in two rows along a straight corridor so as to… 
2012
2012
Problem statement: Many optimization problems of practical interest are encountered in various fields of chemical, engineering… 
2008
2008
The paper presents a study of local search heuristics in general and variable neighborhood search in particular for the… 
2008
2008
A novel nurse rostering model is developed to represent real world problem instances more accurately. The proposed model is… 
2007
2007
A very important factor for the success of a local search is the neighborhood employed during the search. Variable Neighborhood… 
2007
2007
Data clustering methods have been developed extensively in the data mining literature for detecting useful patterns in large… 
2006
2006
We report on the theory and implementation of a global optimization solver for general constrained nonlinear programming problems…