Results 251 to 260 of about 221,092 (272)
Some of the next articles are maybe not open access.
Variable neighborhood search for location routing
Computers & Operations Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jarboui, Bassem +3 more
openaire +1 more source
Variable neighborhood search and local branching
Computers & Operations Research, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hansen, Pierre +2 more
openaire +2 more sources
Variable neighborhood search: Principles and applications
European Journal of Operational Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hansen, Pierre, Mladenović, Nenad
openaire +2 more sources
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
Attraction probabilities in variable neighborhood search
4OR, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brimberg, Jack +2 more
openaire +1 more source
General Variable Neighborhood Search for computing graph separators
Optimization Letters, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sánchez-Oro, Jesús +2 more
openaire +2 more sources
Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search
Journal of Global Optimization, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Audet, Charles +2 more
openaire +3 more sources
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
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.
M. Lalonde, L. Gagnon
openaire +1 more source

