Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Stokastisk genetisk algoritm× | Simulated Annealing – Probabilistisk Optimering× | |
|---|---|---|
| Ämnesområde≠ | Simulering | Optimering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1975 | 1983 |
| Upphovsperson≠ | Holland, J. H. | — |
| Typ≠ | Stochastic evolutionary metaheuristic | Probabilistic metaheuristic / local search |
| Ursprungskälla≠ | Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110 | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| Alias≠ | SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| Närliggande | 5 | 5 |
| Sammanfattning≠ | 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. | 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. |
| ScholarGateDatamängd ↗ |
|
|