Results 231 to 240 of about 21,842 (258)
Some of the next articles are maybe not open access.
Developments of Variable Neighborhood Search
2002Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic change of neighborhood within a possibly randomized local search. Its development has been rapid. After reviewing the basic scheme of VNS, several extensions aimed at solving large problem instances ...
Pierre Hansen, Nenad Mladenović
openaire +1 more source
An Introduction to Variable Neighborhood Search
1999In this paper we examine a relatively unexplored approach to the design of heuristics, the guided change of neighborhood in the search process. Using systematically this idea and very little more, i.e., only a local search routine, leads to a new metaheuristic, which is widely applicable. We call this approach Variable Neighborhood Search (VNS).
Pierre Hansen, Nenad Mladenović
openaire +1 more source
The effect of learning mechanism in Variables Neighborhood Search
2012 4th Conference on Data Mining and Optimization (DMO), 2012The basic idea of the Variable Neighborhood Search (VNS) algorithm is to systematically explore the neighborhood of current solution using a set of predefined neighborhood structures. Since different problem instances have different landscape and complexity, the choice of which neighborhood structure to be applied is a challenging task.
Rafidah Abdul Aziz +2 more
openaire +2 more sources
Variable Neighborhood Search with Permutation Distance for QAP
2005QAP is a famous $\mathcal{NP}-$Hard [1] combinatorial optimization problem. Many theoretical and real-life problems could be modeled as it. VNS is a recent metaheuristic and shows good performance in dealing with QAP [2]. In this paper, a new concept distance called permutation distance is proposed and exploited in detail.
Chong Zhang, Zhangang Lin, Zuoquan Lin
openaire +2 more sources
Hybridizations of evolutionary algorithms with Large Neighborhood Search
Computer Science Review, 2022Anton Eremeev +2 more
exaly
Personnel Rostering by Means of Variable Neighborhood Search
2011The article presents a Variable Neighborhood Search approach for personnel rostering problems, with a particular computer implementation (and results) for the data sets of the very recent First International Nurse Rostering Competition 2010. In this context, our work is motivated by two objectives: (i) The very fast computation of qualitatively good ...
openaire +2 more sources