Σύγκριση μεθόδων

	Μπεϋζιανή Προσομοιωμένη Ανόπτηση	Γενετικός Αλγόριθμος Bayes
Πεδίο	Προσομοίωση	Προσομοίωση
Οικογένεια	Process / pipeline	Process / pipeline
Έτος προέλευσης	1984	1999
Δημιουργός	Geman, S. & Geman, D. (Bayesian framing); Kirkpatrick, S. et al. (SA foundation)	Pelikan, M., Goldberg, D. E., & Cantu-Paz, E.
Τύπος	Probabilistic metaheuristic with Bayesian inference	Evolutionary metaheuristic with Bayesian probabilistic model
Θεμελιώδης πηγή	Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680.	Pelikan, M., Goldberg, D. E., & Cantu-Paz, E. (1999). BOA: The Bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999), pp. 525–532. Morgan Kaufmann.
Εναλλακτικές ονομασίες	BSA, Bayesian SA, Bayesian Stochastic Annealing, Bayesian Thermodynamic Optimization	BGA, Bayesian-guided GA, Probabilistic GA, EDA-GA
Συναφείς	5	5
Σύνοψη	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.	A Bayesian Genetic Algorithm (BGA) replaces traditional crossover and mutation operators with a probabilistic Bayesian network learned from selected high-fitness individuals. At each generation the algorithm builds a graphical model of promising solution structure, then samples new offspring from that model, enabling the search to capture and exploit variable dependencies that standard GAs miss.