विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| स्टोकेस्टिक टैबू सर्च× | स्टोकेस्टिक जेनेटिक एल्गोरिथम× | |
|---|---|---|
| क्षेत्र | अनुकरण | अनुकरण |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1990s | 1975 |
| प्रवर्तक≠ | Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s) | Holland, J. H. |
| प्रकार≠ | Stochastic metaheuristic optimizer | Stochastic evolutionary metaheuristic |
| मौलिक स्रोत≠ | Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94. DOI ↗ | Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110 |
| उपनाम | STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search | SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm |
| संबंधित | 5 | 5 |
| सारांश≠ | 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. | The Stochastic Genetic Algorithm (SGA) is a population-based metaheuristic that mimics biological evolution — selection, crossover, and mutation — to search for near-optimal solutions in complex, nonlinear, or combinatorial spaces. Its randomized operators make it robust to local optima and broadly applicable across engineering, scheduling, machine learning, and operations research. |
| ScholarGateडेटासेट ↗ |
|
|