Annals of Operations Research

, Volume 175, Issue 1, pp 367–407

Variable neighbourhood search: methods and applications

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

DOI: 10.1007/s10479-009-0657-6

Cite this article as:
Hansen, P., Mladenović, N. & Moreno Pérez, J.A. Ann Oper Res (2010) 175: 367. doi:10.1007/s10479-009-0657-6

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 

Copyright information

© Springer Science+Business Media, LLC 2009

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 UniversityUxbridgeUnited Kingdom
  3. 3.IUDR and DEIOCUniversity of La LagunaLa LagunaSpain