Stochastic Genetic Algorithm — Randomized Evolutionary Search for Optimization
Stochastic Genetic Algorithm — Randomized evolutionary search for combinatorial and continuous optimization · Also known as: SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm
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.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use a Stochastic Genetic Algorithm when: (1) the search space is large, multimodal, or discontinuous and gradient-based methods fail or are inapplicable; (2) the objective function is black-box, noisy, or expensive to evaluate but tractable for population-level sampling; (3) combinatorial or mixed-integer problems lack efficient exact solvers; (4) a near-optimal solution found within a reasonable number of evaluations is acceptable. Do NOT use SGA when: the problem is convex or the gradient is available and cheap — classical optimization converges faster; when function evaluations are extremely expensive (tens or hundreds), population-based methods may exhaust the budget; or when a provably optimal solution is required, since GAs offer no optimality guarantees.
Strengths & limitations
- Does not require gradient information — applicable to black-box, discontinuous, or non-differentiable objectives.
- Naturally handles combinatorial, mixed-integer, and permutation search spaces with appropriate encoding.
- Parallelizable by design: the population can be evaluated in parallel, reducing wall-clock time.
- Robust against local optima due to population diversity and stochastic exploration.
- Highly extensible: operators, encodings, and selection schemes can be customized for domain-specific constraints.
- No guarantee of finding the global optimum; solution quality depends on population size, operator choices, and number of generations.
- Computationally expensive relative to gradient-based methods on smooth, low-dimensional problems — many function evaluations are required.
- Hyperparameter tuning (population size, crossover rate, mutation rate) is problem-dependent and often requires experimentation.
- Premature convergence can occur if selection pressure is too high or mutation rate is too low, trapping the search in suboptimal regions.
Frequently asked
How is a Stochastic Genetic Algorithm different from a standard Genetic Algorithm?
The 'stochastic' label emphasizes that all core operators — selection, crossover, and mutation — involve probabilistic draws. The canonical GA introduced by Holland is inherently stochastic. The label is used in the simulation/optimization literature to distinguish from rare deterministic variants (e.g., deterministic crowding) and to clarify that the algorithm's behavior varies across runs due to randomness.
How large should the population be?
A common starting point is 50–200 individuals for moderate-dimensional problems. Larger populations improve diversity and reduce premature convergence but increase computational cost per generation. Rules of thumb based on chromosome length (e.g., 10× the number of genes) exist, but empirical tuning or meta-optimization is often necessary.
When should I prefer Particle Swarm Optimization or Simulated Annealing over a Genetic Algorithm?
Particle Swarm Optimization (PSO) is often faster on continuous real-valued problems because it exploits velocity information. Simulated Annealing (SA) is simpler to implement and can be effective for single-solution trajectory search. GAs are preferred when the search space is combinatorial, when crossover meaningfully recombines solution structures, or when population diversity is valuable for multi-modal landscapes.
Does the Stochastic Genetic Algorithm scale to high-dimensional problems?
Performance degrades in very high dimensions (hundreds to thousands of variables) because the population must be large enough to sample the space adequately. Specialized variants — such as linkage-learning GAs, estimation of distribution algorithms, or island models with migration — address scalability but add complexity.
How do I handle constraints in a Genetic Algorithm?
Three main strategies are used: (1) penalty functions that reduce fitness for constraint violations; (2) repair operators that project infeasible offspring back into the feasible region; (3) specialized encodings and operators that only produce feasible solutions by construction. Penalty-based methods are easiest to implement but require careful calibration of penalty coefficients.
Sources
- Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110
- Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA. ISBN: 978-0201157673
How to cite this page
ScholarGate. (2026, June 3). Stochastic Genetic Algorithm — Randomized evolutionary search for combinatorial and continuous optimization. ScholarGate. https://scholargate.app/en/simulation/stochastic-genetic-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Genetic AlgorithmOptimization↔ compare
- Particle Swarm OptimizationOptimization↔ compare
- Simulated AnnealingOptimization↔ compare
- Stochastic Multi-Objective OptimizationSimulation↔ compare
- Stochastic Particle Swarm OptimizationSimulation↔ compare