השוואת שיטות

	חיפוש סביבות משתנות (VNS)	אלגוריתם גנטי	חיפוש טאבו
תחום	אופטימיזציה	אופטימיזציה	אופטימיזציה
משפחה	Process / pipeline	Process / pipeline	Process / pipeline
שנת המקור	1997	1975	1989
הוגה השיטה	—	John Henry Holland	Fred Glover
סוג	Metaheuristic — neighborhood-based	Population-based metaheuristic	Local-search metaheuristic
מקור מכונן	Mladenović, N. & Hansen, P. (1997). Variable Neighborhood Search. Computers & Operations Research, 24(11), 1097–1100.	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.	Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206.
כינויים	VNS, Değişken Komşuluk Araması (VNS), variable neighbourhood search	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon	Tabu Araması (Tabu Search), TS, tabu metaheuristic
קשורות	4	5	4
תקציר	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.	A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail.	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.