[图书][B] Variable neighborhood search

Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global
optimization problems whose basic idea is a systematic change of neighborhood both within …

Multi-objective variable neighborhood search: an application to combinatorial optimization problems

A Duarte, JJ Pantrigo, EG Pardo… - Journal of Global …, 2015 - Springer
Solutions to real-life optimization problems usually have to be evaluated considering
multiple conflicting objectives. These kind of problems, known as multi-objective …

GRASP with path relinking for the orienteering problem

V Campos, R Martí, J Sánchez-Oro… - Journal of the …, 2014 - Taylor & Francis
In this paper, we address an optimization problem resulting from the combination of the well-
known travelling salesman and knapsack problems. In particular, we target the orienteering …

Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization

A Duarte, J Sánchez-Oro, MGC Resende, F Glover… - Information …, 2015 - Elsevier
We propose several new hybrid heuristics for the differential dispersion problem, the best of
which consists of a GRASP with sampled greedy construction with variable neighborhood …

Variable formulation search for the cutwidth minimization problem

EG Pardo, N Mladenović, JJ Pantrigo, A Duarte - Applied Soft Computing, 2013 - Elsevier
Many optimization problems are formulated as min–max problems where the objective
function consist of minimizing a maximum value. In this case, it is usual that many solutions …

Combining intensification and diversification strategies in VNS. An application to the vertex separation problem

J Sánchez-Oro, JJ Pantrigo, A Duarte - Computers & Operations Research, 2014 - Elsevier
Abstract The Vertex Separation problem (VSP) is an NP-hard problem with practical
applications in VLSI design, graph drawing and computer language compiler design. VSP …

[HTML][HTML] A GRASP method for the bi-objective multiple row equal facility layout problem

NR Uribe, A Herrán, JM Colmenar - Applied Soft Computing, 2024 - Elsevier
Abstract The Bi-Objective Multiple Row Equal Facility Layout Problem considers both
quantitative and qualitative objectives that are very useful in many scenarios like the factory …

Parallel variable neighbourhood search strategies for the cutwidth minimization problem

A Duarte, JJ Pantrigo, EG Pardo… - IMA Journal of …, 2016 - academic.oup.com
Variable neighbourhood search (VNS) and all its variants have been successfully proved in
hard combinatorial optimization problems. However, there are only few works concerning …

Variable neighborhood search for the vertex separation problem

A Duarte, LF Escudero, R Martí, N Mladenovic… - Computers & Operations …, 2012 - Elsevier
The Vertex Separation Problem belongs to a family of optimization problems in which the
objective is to find the best separator of vertices or edges in a generic graph. This …

An improved GRASP method for the multiple row equal facility layout problem

NR Uribe, A Herrán, JM Colmenar, A Duarte - Expert Systems with …, 2021 - Elsevier
As it is well documented in the literature, an effective facility layout design of a company
significantly increases throughput, overall productivity, and efficiency. Symmetrically, a poor …