Process / pipelineSimulation / optimization

Bayesian Genetic Algorithm — Probabilistic model-guided evolutionary optimization

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. 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. link
  2. Larranaga, P., & Lozano, J. A. (Eds.) (2002). Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Boston. ISBN: 9781461352747

Related methods

Referenced by

ScholarGateBayesian Genetic Algorithm (Bayesian Genetic Algorithm — Probabilistic model-guided evolutionary optimization). Retrieved 2026-06-04 from https://scholargate.app/en/simulation/bayesian-genetic-algorithm