Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Recalire simulată× | Optimizarea prin roi de particule (PSO)× | |
|---|---|---|
| Domeniu | Optimizare | Optimizare |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1983 | 1995 |
| Autorul original | — | — |
| Tip≠ | Probabilistic metaheuristic / local search | Population-based metaheuristic / swarm intelligence |
| Sursa seminală≠ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| Denumiri alternative | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| Înrudite≠ | 5 | 6 |
| Rezumat≠ | Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems. | 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. |
| ScholarGateSet de date ↗ |
|
|