Variable neighborhood search

By Pierre Hansen, Nenad Mladenovic, José Andrés Moreno-Pérez. European Journal of Operational Research, 2008

1,492 citations recorded by the source corpus.

Subfields: Computer Vision and Pattern Recognition, Media Technology, Radiology, Nuclear Medicine and Imaging

View Paper: https://www.semanticscholar.org/paper/5bfed34ab19ab542cc35f59236331ba634ff11fe

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

In Media Technology

In Radiology, Nuclear Medicine and Imaging

Citations in the corpus

Optimal PMU Placement for Power System Dynamic State Estimation by Using Empirical Observability Gramian (2014, methodology): “c) NOMAD also includes a Variable Neighborhood Search (VNS) algorithm [46], which is based on the VNS metaheuristic [47].”
Heuristic Optimization Methods in Econometrics (2009, background): “…not accepted (left panel) we return to x c (not x i ) and continue (right panel). x c F (x c ) x i x n x c F (x c ) x i x n x i x n Iterated local search (Lourenço et al., 2002) and variable neighborhood search (VNS) (Mladenovic and Hansen, 1997) also fall into this class of hybrid meta-heuristics.”
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (2010, methodology): “The local search is performed by a Variable Neighborhood Descent [41] procedure which utilizes a random neighborhood ordering (RVND).”
Integer programming techniques for the nurse rostering problem (2014, methodology): “The local search phase explores the search space through several neighborhoods, using a VND (Variable Neighborhood Descent) [26] scheme.”
Solving Mixed Integer Programs Using Neural Networks (2020, methodology): “For this reason one could reasonably call our method a hybrid of diving and neighborhood search (Mladenović and Hansen 1997, Hansen et al. 2010), but for brevity we refer to it simply as Neural Diving.”
Experimental investigation of heuristics for resource-constrained project scheduling: An update (2006, methodology): “Fleszar and Hindi [21] apply a variable neighborhood search (VNS, a metaheuristic strategy introduced by Mladenovic and Hansen [47]) to the RCPSP.”
A variable neighborhood search heuristic for periodic routing problems (2009, neutral): “See Mladenovi´c and Hansen (1997) and Hansen and Mladenovi´c (2000, 2001) for a more thorough description of VNS.”
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (2006, methodology): “The related Variable Neighborhood Search (VNS) was proposed by Mladenovi ´ c and Hansen [14].”
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (2007, methodology): “Local search in this work was based on the insert + interchange variant of the VNS method presented in [25].”