Compara mètodes
Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.
| Cuckoo Search× | Algorisme genètic× | |
|---|---|---|
| Camp | Optimització | Optimització |
| Família | Process / pipeline | Process / pipeline |
| Any d'origen≠ | 2009 | 1975 |
| Autor original≠ | — | John Henry Holland |
| Tipus≠ | Population-based metaheuristic / swarm intelligence | Population-based metaheuristic |
| Font seminal≠ | Yang, X.S. & Deb, S. (2009). Cuckoo Search via Lévy Flights. 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 210-214. IEEE. link ↗ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| Àlies | Guguk Kuşu Araması (Cuckoo Search), CS algorithm, Cuckoo Search via Lévy Flights | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| Relacionats≠ | 6 | 5 |
| Resum≠ | Cuckoo Search (CS) is a population-based metaheuristic optimization algorithm introduced by Xin-She Yang and Suash Deb in 2009. It models the obligate brood-parasitism of cuckoo birds — which lay eggs in other birds' nests — combined with Lévy flight random walks that enable long-range exploration of the search space. The algorithm has proven effective in structural engineering design, machine learning hyperparameter tuning, and other continuous black-box optimization problems. | 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. |
| ScholarGateConjunt de dades ↗ |
|
|