ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Stochastic Genetic Algorithm×Simulirano žarenje×
PodručjeSimulacijaOptimizacija
ObiteljProcess / pipelineProcess / pipeline
Godina nastanka19751983
TvoracHolland, J. H.
VrstaStochastic evolutionary metaheuristicProbabilistic metaheuristic / local search
Temeljni izvorHolland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗
Drugi naziviSGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary AlgorithmBenzetimli Tavlama (Simulated Annealing), SA, probabilistic local search
Srodne55
SažetakThe 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.Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Stochastic Genetic Algorithm · Simulated Annealing. Preuzeto 2026-06-17 s https://scholargate.app/hr/compare