ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

البحث العشوائي المحظور×البحث المحظور×
المجالالمحاكاةالتحسين
العائلةProcess / pipelineProcess / pipeline
سنة النشأة1990s1989
صاحب الطريقةGlover, F. (base TS); stochastic extensions by various authors (1990s–2000s)Fred Glover
النوعStochastic metaheuristic optimizerLocal-search metaheuristic
المصدر التأسيسيGlover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94. DOI ↗Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗
الأسماء البديلةSTS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu SearchTabu Araması (Tabu Search), TS, tabu metaheuristic
ذات صلة54
الملخص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.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.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Stochastic Tabu Search · Tabu Search. استُرجع بتاريخ 2026-06-19 من https://scholargate.app/ar/compare