পদ্ধতির তুলনা করুন

	ট্যাবু সার্চ	Simulated annealing
ক্ষেত্র	অনুকূলকরণ	অনুকূলকরণ
পরিবার	Process / pipeline	Process / pipeline
উদ্ভবের বছর	1989	1983
প্রবর্তক	Fred Glover	—
ধরন	Local-search metaheuristic	Probabilistic metaheuristic / local search
মৌলিক উৎস	Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206.	Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680.
অপর নাম	Tabu Araması (Tabu Search), TS, tabu metaheuristic	Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search
সম্পর্কিত	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.	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.