Porównaj metody

	Stochastyczne przeszukiwanie z tabu	Optymalizacja rojem cząstek (PSO)
Dziedzina	Symulacja	Optymalizacja
Rodzina	Process / pipeline	Process / pipeline
Rok powstania	1990s	1995
Twórca	Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s)	—
Typ	Stochastic metaheuristic optimizer	Population-based metaheuristic / swarm intelligence
Źródło pierwotne	Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94.	Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948.
Inne nazwy	STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Pokrewne	5	6
Podsumowanie	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.	Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems.