Porównaj metody

	Variable Neighborhood Search (VNS)	Przeszukiwanie tabu
Dziedzina	Optymalizacja	Optymalizacja
Rodzina	Process / pipeline	Process / pipeline
Rok powstania	1997	1989
Twórca	—	Fred Glover
Typ	Metaheuristic — neighborhood-based	Local-search metaheuristic
Źródło pierwotne	Mladenović, N. & Hansen, P. (1997). Variable Neighborhood Search. Computers & Operations Research, 24(11), 1097–1100.	Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206.
Inne nazwy	VNS, Değişken Komşuluk Araması (VNS), variable neighbourhood search	Tabu Araması (Tabu Search), TS, tabu metaheuristic
Pokrewne	4	4
Podsumowanie	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.	Tabu Search is a local-search metaheuristic introduced by Fred Glover in 1989 that uses a tabu list — a short-term memory of recently visited solutions — to prevent cycling and escape local optima. By explicitly forbidding moves that reverse recent decisions, the algorithm explores the search space more broadly and, through long-term memory structures such as aspiration criteria, aims to approach the global optimum even in large, complex combinatorial problems.