Variable Neighborhood Search : Methods and Applications

  title={Variable Neighborhood Search : Methods and Applications},
  author={Pierre Hansen},
Variable neighborhood search (VNS) is a metaheuristic, or framework for building heuristics, based upon systematic change of neighborhoods both in a decent phase to find a local minimum, and in a perturbation phase to get out of the corresponding valley. It was first proposed in 1997 and since has rapidly developed both in its methods and its applications. Both of these aspects are thouroughly reviewed and a large bibliography is given. 
Highly Cited
This paper has 93 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
51 Citations
236 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 51 extracted citations

93 Citations

Citations per Year
Semantic Scholar estimates that this publication has 93 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 236 references

Computers in Graph Theory Graph Theory Notes of New York XLIII:20-39

  • P Hansen
  • 2002
Highly Influential
4 Excerpts

A variable neighborhood algorithm for solving the continuous location-allocation problem

  • J Brimberg, N Mladenović
  • Studies in Locational Analysis
  • 1996
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…