Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Optymalizacja rojem cząstek (PSO)× | Algorytm genetyczny× | |
|---|---|---|
| Dziedzina | Optymalizacja | Optymalizacja |
| Rodzina | Process / pipeline | Process / pipeline |
| Rok powstania≠ | 1995 | 1975 |
| Twórca≠ | — | John Henry Holland |
| Typ≠ | Population-based metaheuristic / swarm intelligence | Population-based metaheuristic |
| Źródło pierwotne≠ | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| Inne nazwy | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| Pokrewne≠ | 6 | 5 |
| Podsumowanie≠ | 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. | 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. |
| ScholarGateZbiór danych ↗ |
|
|