Results 221 to 230 of about 21,842 (258)

Attraction probabilities in variable neighborhood search

4OR, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jack Brimberg, Pierre Hansen, Nenad Mladenovic   +2 more
openaire   +1 more source

Variable neighborhood search for the heaviest -subgraph

Computers & Operations Research, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jack Brimberg, Nenad Mladenovic, Dragan Urosevic, Eric Ngai   +3 more
openaire   +3 more sources

Variable neighborhood search for the Vertex Separation Problem

Computers & Operations Research, 2012
The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others.
Abraham Duarte, Laureano F. Escudero, Rafael Martí, Nenad Mladenovic, Juan José Pantrigo, Jesús Sánchez-Oro   +5 more
openaire   +3 more sources

Variable neighborhood search for the dial-a-ride problem

Computers & Operations Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl   +2 more
openaire   +3 more sources

Variable Neighborhood Search for the Orienteering Problem

2006
The Orienteering Problem (OP) is a version of TSP with profits in which instead of a cycle, a path is sought. In this paper, we consider three variations of Variable Neighborhood Search (VNS) and present the first algorithm solely based on VNS to solve the OP.
Aise Zülal Sevkli, Fatih Erdogan Sevilgen   +1 more
openaire   +2 more sources

Partitioning with Variable Neighborhood Search: A bioinspired approach

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC), 2012
The artificial vision allows us to reduce a problem by means of techniques that have obeyed the study of the intelligence of living systems. A well-known technique is data mining and pattern recognition, which are disciplines dependent of artificial intelligence that from some data, allow the acquisition of knowledge and in particular, within data ...
María Beatríz Bernábe-Loranca, Rogelio González-Velázquez, Elías Olivares Benítez, David Pinto Avendaño, Javier Ramírez Rodríguez, José Luis Martínez Flores   +5 more
openaire   +2 more sources

Variable Neighborhood Search for Integrated Planning and Scheduling

2017
In 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, Cláudio Alves, Telmo Pinto 0001   +2 more
openaire   +3 more sources

General variable neighborhood search for the continuous optimization

European Journal of Operational Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vujcic, Mirjana Cangalovic   +3 more
openaire   +3 more sources

Variable neighborhood search for geometrically deformable templates

Object recognition supported by user interaction for service robots, 2003
This 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, 2007
Variable 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