Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Algoritmo Genético× | Optimización por Enjambre de Partículas (PSO)× | |
|---|---|---|
| Campo | Optimización | Optimización |
| Familia | Process / pipeline | Process / pipeline |
| Año de origen≠ | 1975 | 1995 |
| Autor original≠ | John Henry Holland | — |
| Tipo≠ | Population-based metaheuristic | Population-based metaheuristic / swarm intelligence |
| Fuente seminal≠ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| Alias | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| Relacionados≠ | 5 | 6 |
| Resumen≠ | 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. | Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems. |
| ScholarGateConjunto de datos ↗ |
|
|