ScholarGate
Msaidizi

Linganisha mbinu

Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.

Algorithmu ya Kijenetiki ya Kistokastiki×Simulated Annealing×
NyanjaUigajiUboreshaji
FamiliaProcess / pipelineProcess / pipeline
Mwaka wa asili19751983
MwanzilishiHolland, J. H.
AinaStochastic evolutionary metaheuristicProbabilistic metaheuristic / local search
Chanzo asiliaHolland, 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 ↗
Majina mbadalaSGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary AlgorithmBenzetimli Tavlama (Simulated Annealing), SA, probabilistic local search
Zinazohusiana55
MuhtasariThe 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.
ScholarGateSeti ya data
  1. v1
  2. 2 Vyanzo
  3. PUBLISHED
  1. v1
  2. 2 Vyanzo
  3. PUBLISHED

Nenda kwenye utafutaji Pakua slaidi

ScholarGateLinganisha mbinu: Stochastic Genetic Algorithm · Simulated Annealing. Imepatikana 2026-06-17 kutoka https://scholargate.app/sw/compare