手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| 確率的遺伝的アルゴリズム× | 焼きなまし法× | |
|---|---|---|
| 分野≠ | シミュレーション | 最適化 |
| 系統 | Process / pipeline | Process / pipeline |
| 提唱年≠ | 1975 | 1983 |
| 提唱者≠ | Holland, J. H. | — |
| 種類≠ | Stochastic evolutionary metaheuristic | Probabilistic metaheuristic / local search |
| 原典≠ | 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 ↗ |
| 別名≠ | SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| 関連 | 5 | 5 |
| 概要≠ | 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. |
| ScholarGateデータセット ↗ |
|
|