Variable Neighborhood Search
Variable Neighborhood Search (VNS) is a metaheuristic optimization framework introduced by Mladenović and Hansen in 1997. It escapes local optima by systematically switching among a predefined set of neighborhood structures — first perturbing the current solution (shaking) to reach a different region of the search space, then applying a local search within that region, and finally accepting the new solution only if it improves the incumbent. The method is flexible enough to handle combinatorial problems (routing, scheduling, graph problems) as well as continuous optimization, making it one of the most widely used neighborhood-based metaheuristics in operations research.
Kilderegister
Siteringer kopiert ordrett fra metodens kilderegister. Ingen påstandsnivåverifisering er underforstått fra dem.
- Mladenović, N. & Hansen, P. (1997). Variable Neighborhood Search. Computers & Operations Research, 24(11), 1097–1100. · DOI 10.1016/S0305-0548(97)00031-2
- Hansen, P., Mladenović, N., Brimberg, J. & Pérez, J.A.M. (2019). Variable Neighborhood Search: Basics and Variants. EURO Journal on Computational Optimization, 7(1), 3–56. · DOI 10.1007/978-3-319-91086-4_3
Kuraterte påstander
Påstander lagret i bevishovedboken, hver med sin egen vurdering.
Denne visningen finner ikke opp en påstandsvurdering når hovedboken ikke har noen.
Relaterte metoder
Generert fra metodegrafen og vist som maskinforslåtte relasjoner – ingen bevispåstand er underforstått.