विधियों की तुलना करें

	Tabu Search	जेनेटिक एल्गोरिथम
क्षेत्र	अनुकूलन	अनुकूलन
परिवार	Process / pipeline	Process / pipeline
उद्भव वर्ष	1989	1975
प्रवर्तक	Fred Glover	John Henry Holland
प्रकार	Local-search metaheuristic	Population-based metaheuristic
मौलिक स्रोत	Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206.	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
उपनाम	Tabu Araması (Tabu Search), TS, tabu metaheuristic	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon
संबंधित	4	5
सारांश	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.	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.