Variable neighbourhood search: methods and applications

@article{Hansen2010VariableNS,
  title={Variable neighbourhood search: methods and applications},
  author={P. Hansen and N. Mladenovic and Jos{\'e} A. Moreno P{\'e}rez},
  journal={Annals of Operations Research},
  year={2010},
  volume={175},
  pages={367-407}
}
  • P. Hansen, N. Mladenovic, José A. Moreno Pérez
  • Published 2010
  • Mathematics
  • Annals of Operations Research
  • 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… CONTINUE READING
    341 Citations
    Variable neighborhood search: basics and variants
    • 109
    MaxMinMin p-dispersion problem: A variable neighborhood search approach
    • 12
    New Variable Neighborhood Search Structure for Travelling Salesman Problems
    • 1
    A variable neighborhood descent approach for the two-dimensional bin packing problem
    • 6
    Calculating Elementary Flux Modes with Variable Neighbourhood Search
    A metaheuristic approach to the dominating tree problem
    • 4

    References

    SHOWING 1-10 OF 279 REFERENCES
    Variable Neighborhood Decomposition Search
    • 295
    • PDF
    Variable Neighbourhood Search for Job Shop Scheduling Problems
    • 23
    • PDF
    A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems
    • 40
    General variable neighborhood search for the continuous optimization
    • 117
    • PDF