Results 261 to 270 of about 5,119,730 (291)
Some of the next articles are maybe not open access.
Variable Neighborhood Search for Integrated Planning and Scheduling
2017In this paper, we consider the integrated planning and scheduling problem on parallel and identical machines. The problem is composed by two parts which are simultaneously solved in an integrated form. The first is the planning part, which consists in determining the jobs that should be processed in each period of time.
Mário Leite +2 more
openaire +3 more sources
General variable neighborhood search for the continuous optimization
European Journal of Operational Research, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nenad Mladenovic +3 more
openaire +3 more sources
Variable neighborhood search for geometrically deformable templates
Object recognition supported by user interaction for service robots, 2003This paper proposes two modifications to the geometrically deformable template model. First, the optimization stage originally based on simulated annealing is replaced with a meta-heuristic called Variable Neighborhood Search that treats simulated annealing as a local search tool.
Marc Lalonde, Langis Gagnon
openaire +2 more sources
Introduction to the special issue on variable neighborhood search
Journal of Heuristics, 2007Variable Neighborhood Search (VNS) is a metaheuristic for solving optimization problems based on systematic changes of structure within a search that may be performed in a deterministic way (Variable Neighborhood Descent, VND) or randomly (reduced VNS).
J. Marcos Moreno-Vega, Belén Melián
openaire +1 more source
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
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 V Eremeev +2 more
exaly