Comparar métodos

	Algoritmo Genético Bayesiano	Otimização Bayesiana Multiobjetivo
Área	Simulação	Simulação
Família	Process / pipeline	Process / pipeline
Ano de origem	1999	2006-2016
Autor original	Pelikan, M., Goldberg, D. E., & Cantu-Paz, E.	Emmerich, M.; Svenson, J.; and related Gaussian process optimization community
Tipo	Evolutionary metaheuristic with Bayesian probabilistic model	Surrogate-model-assisted multi-objective optimizer
Fonte seminal	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.	Svenson, J., Santner, T. (2016). Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models. Computational Statistics & Data Analysis, 94, 250-264.
Outros nomes	BGA, Bayesian-guided GA, Probabilistic GA, EDA-GA	BMOO, Bayesian MOO, Multi-objective Bayesian optimization, MOBO
Relacionados	5	3
Resumo	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.	Bayesian Multi-Objective Optimization (BMOO/MOBO) uses Gaussian process surrogate models to approximate multiple expensive objective functions and guides the search toward the Pareto frontier with minimal real evaluations. By quantifying prediction uncertainty at each candidate point, it balances exploration of unknown regions against exploitation of promising solutions, making it especially powerful when each function evaluation is computationally or experimentally costly.