방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 결정론적 유전 알고리즘× | 유전 알고리즘× | |
|---|---|---|
| 분야≠ | 시뮬레이션 | 최적화 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1975–1989 | 1975 |
| 창시자≠ | Goldberg, D. E.; Holland, J. H. | John Henry Holland |
| 유형≠ | Deterministic evolutionary optimization | Population-based metaheuristic |
| 원전≠ | Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA. ISBN: 9780201157673 | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| 별칭≠ | DGA, Deterministic EA, Deterministic Evolutionary Algorithm, Deterministic Selection GA | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| 관련 | 5 | 5 |
| 요약≠ | A Deterministic Genetic Algorithm (DGA) applies the structural framework of evolutionary computation — population, selection, crossover, and replacement — using entirely deterministic operators and fixed decision rules instead of stochastic sampling. By eliminating randomness, the algorithm becomes fully reproducible: running it twice on the same problem yields identical solutions, making it tractable for rigorous benchmarking, reproducibility studies, and systems where stochasticity is undesirable. | A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail. |
| ScholarGate데이터셋 ↗ |
|
|