Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Recalire simulată× | Ant Colony Optimization× | |
|---|---|---|
| Domeniu | Optimizare | Optimizare |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1983 | 1992 (foundational thesis); 1997 (Ant Colony System formalization) |
| Autorul original | — | — |
| Tip≠ | Probabilistic metaheuristic / local search | Metaheuristic — swarm intelligence |
| Sursa seminală≠ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ | Dorigo, M. & Gambardella, L.M. (1997). Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1(1), 53-66. DOI ↗ |
| Denumiri alternative | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search | ACO, Karınca Kolonisi Optimizasyonu (ACO), ant colony system |
| Înrudite | 5 | 5 |
| 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. | Ant Colony Optimization (ACO) is a metaheuristic algorithm introduced by Marco Dorigo and colleagues in the early 1990s that solves combinatorial optimisation problems by simulating the collective foraging behaviour of ants. Real ants lay pheromone trails on paths and preferentially follow stronger trails; ACO turns this positive-feedback mechanism into a search procedure that finds high-quality solutions to graph-structured problems such as the Travelling Salesman Problem, vehicle routing, and scheduling. |
| ScholarGateSet de date ↗ |
|
|