Sammenlign metoder

	Variable Neighborhood Search (VNS)	Simulated Annealing	Tabu Search
Fagområde	Optimering	Optimering	Optimering
Familie	Process / pipeline	Process / pipeline	Process / pipeline
Oprindelsesår	1997	1983	1989
Ophavsperson	—	—	Fred Glover
Type	Metaheuristic — neighborhood-based	Probabilistic metaheuristic / local search	Local-search metaheuristic
Oprindelig kilde	Mladenović, N. & Hansen, P. (1997). Variable Neighborhood Search. Computers & Operations Research, 24(11), 1097–1100.	Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680.	Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206.
Aliasser	VNS, Değişken Komşuluk Araması (VNS), variable neighbourhood search	Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search	Tabu Araması (Tabu Search), TS, tabu metaheuristic
Relaterede	4	5	4
Resumé	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.	Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems.	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.