Methoden vergelijken
Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.
| Genetisch Algoritme× | NSGA-II× | |
|---|---|---|
| Vakgebied | Optimalisatie | Optimalisatie |
| Familie | Process / pipeline | Process / pipeline |
| Jaar van ontstaan≠ | 1975 | 2002 |
| Grondlegger≠ | John Henry Holland | — |
| Type≠ | Population-based metaheuristic | Evolutionary multi-objective optimisation algorithm |
| Oorspronkelijke bron≠ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ | Deb, K., Pratap, A., Agarwal, S. & Meyarivan, T. (2002). A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182-197. DOI ↗ |
| Aliassen | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon | NSGA2, Non-dominated Sorting GA II, NSGA-II — Çok Amaçlı Evrimsel Optimizasyon |
| Verwant≠ | 5 | 4 |
| Samenvatting≠ | 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. | NSGA-II (Non-dominated Sorting Genetic Algorithm II) is the standard reference algorithm for multi-objective evolutionary optimisation, introduced by Deb, Pratap, Agarwal and Meyarivan in 2002. Rather than collapsing multiple conflicting objectives into a single score, it evolves a population of candidate solutions across generations and returns a set of Pareto-optimal trade-off solutions — the Pareto front — using fast non-dominated sorting and a crowding distance metric to preserve diversity. |
| ScholarGateGegevensset ↗ |
|
|