4OR

, Volume 6, Issue 4, pp 319–360

Variable neighbourhood search: methods and applications

  • Pierre Hansen
  • Nenad Mladenović
  • José A. Moreno Pérez
Invited Survey

DOI: 10.1007/s10288-008-0089-1

Cite this article as:
Hansen, P., Mladenović, N. & Moreno Pérez, J.A. 4OR (2008) 6: 319. doi:10.1007/s10288-008-0089-1

Abstract

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications. In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided. Moreover, one section is devoted to newcomers. It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics.

Keywords

Variable neighbourhood search Metaheuristic Heuristic 

MSC classification

90C59 68T20 68W25 

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Pierre Hansen
    • 1
  • Nenad Mladenović
    • 2
  • José A. Moreno Pérez
    • 3
  1. 1.GERAD and HEC MontréalMontréalCanada
  2. 2.GERAD and School of MathematicsBrunel UniversityUxbridgeUK
  3. 3.IUDR and Dep. Estadística, I.O. y ComputaciónUniversity of La LagunaLa LagunaSpain

Personalised recommendations