Results 251 to 260 of about 5,119,730 (291)

Variable Neighborhood Search: The power of change and simplicity

Computers & Operations Research, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jack Brimberg, Saïd Salhi, Raca Todosijevic, Dragan Urosevic   +3 more
openaire   +2 more sources

Variable neighborhood search for the p-median

Location Science, 1997
Summary: Consider a set \(L\) of potential locations for \(p\) facilities and a set \(U\) of locations of given users. The \(p\)-median problem is to locate simultaneously the \(p\) facilities at locations of \(L\) in order to minimize the total transportation cost for satisfying the demand of the users, each supplied from its closest facility.
Hansen, P., Mladenović, N.
openaire   +2 more sources

Variable Neighborhood Search

2016
The Variable Neighborhood Search (VNS) metaheuristic was invented by Nenad Mladnovic and Pierre Hansen and developped at GERAD (Group for Research in Decision Analysis, Montral) since ...
Caporossi, Gilles, Hansen, Pierre, Mladenovic, Nenad   +2 more
openaire   +1 more source

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

An Introduction to Variable Neighborhood Search

1999
In 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).
Nenad Mladenovic, Pierre Hansen
exaly   +2 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