เปรียบเทียบวิธี

	Bayesian Simulated Annealing	Genetic Algorithm
สาขาวิชา	การจำลอง	การหาค่าเหมาะที่สุด
ตระกูล	Process / pipeline	Process / pipeline
ปีกำเนิด	1984	1975
ผู้ริเริ่ม	Geman, S. & Geman, D. (Bayesian framing); Kirkpatrick, S. et al. (SA foundation)	John Henry Holland
ประเภท	Probabilistic metaheuristic with Bayesian inference	Population-based metaheuristic
แหล่งต้นตำรับ	Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680.	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
ชื่อเรียกอื่น	BSA, Bayesian SA, Bayesian Stochastic Annealing, Bayesian Thermodynamic Optimization	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon
ที่เกี่ยวข้อง	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 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.