Process / pipelineSimulation / optimization

Bayesian Simulated Annealing — Global Optimization with Bayesian Priors

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680. DOI: 10.1126/science.220.4598.671
  2. Geman, S., & Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6), 721–741. DOI: 10.1109/TPAMI.1984.4767596

Related methods

Referenced by

ScholarGateBayesian Simulated Annealing (Bayesian Simulated Annealing — Probabilistic global optimization with Bayesian priors on the energy landscape). Retrieved 2026-06-04 from https://scholargate.app/en/simulation/bayesian-simulated-annealing