Compară metode

	Stochastic Particle Swarm Optimization	Algoritm Genetic Stocastic
Domeniu	Simulare	Simulare
Familie	Process / pipeline	Process / pipeline
Anul apariției	1995–2002	1975
Autorul original	Kennedy, J. and Eberhart, R. (base PSO); stochastic extensions by Clerc, Kennedy and community	Holland, J. H.
Tip	Metaheuristic optimization — stochastic swarm intelligence	Stochastic evolutionary metaheuristic
Sursa seminală	Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95 - International Conference on Neural Networks, Vol. 4, pp. 1942-1948. IEEE.	Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110
Denumiri alternative	Stochastic PSO, SPSO, Randomized PSO, Probabilistic PSO	SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm
Înrudite	4	5
Rezumat	Stochastic Particle Swarm Optimization (Stochastic PSO) is a swarm-intelligence metaheuristic that extends the standard PSO framework by incorporating explicit stochastic elements — random inertia weights, probabilistic velocity resets, or noise injections — to escape local optima and maintain population diversity throughout the search. It is widely applied to continuous, mixed, and noisy optimization problems in engineering, operations research, and simulation-based design.	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.