Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Simulated Annealing Bayesian× | Recalire simulată× | |
|---|---|---|
| Domeniu≠ | Simulare | Optimizare |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1984 | 1983 |
| Autorul original≠ | Geman, S. & Geman, D. (Bayesian framing); Kirkpatrick, S. et al. (SA foundation) | — |
| Tip≠ | Probabilistic metaheuristic with Bayesian inference | Probabilistic metaheuristic / local search |
| Sursa seminală≠ | Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680. DOI ↗ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| Denumiri alternative≠ | BSA, Bayesian SA, Bayesian Stochastic Annealing, Bayesian Thermodynamic Optimization | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| Înrudite | 5 | 5 |
| Rezumat≠ | Bayesian Simulated Annealing (BSA) integrates Bayesian prior knowledge about the objective landscape into the simulated annealing search process. By encoding beliefs about promising regions as prior distributions and updating them as the search progresses, BSA focuses computational effort on high-probability areas of the solution space, accelerating convergence and improving solution quality compared to uninformed SA. | 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. |
| ScholarGateSet de date ↗ |
|
|