ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

جستجوی ممنوعه تصادفی×آنیل کردن شبیه‌سازی شده×
حوزهشبیه‌سازیبهینه‌سازی
خانوادهProcess / pipelineProcess / pipeline
سال پیدایش1990s1983
پدیدآورGlover, F. (base TS); stochastic extensions by various authors (1990s–2000s)
نوعStochastic metaheuristic optimizerProbabilistic metaheuristic / local search
منبع بنیادینGlover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94. DOI ↗Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗
نام‌های دیگرSTS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu SearchBenzetimli Tavlama (Simulated Annealing), SA, probabilistic local search
مرتبط55
خلاصهStochastic Tabu Search (STS) is an extension of classical Tabu Search that introduces randomness into the neighborhood exploration and move-selection phases. By combining tabu memory — which forbids recently visited solutions — with probabilistic acceptance or random candidate sampling, STS escapes local optima more effectively and explores rugged solution landscapes that deterministic TS may fail to traverse.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.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Stochastic Tabu Search · Simulated Annealing. بازیابی‌شده در 2026-06-19 از https://scholargate.app/fa/compare