ScholarGate
Asistent

Porovnať metódy

Prezrite si vybrané metódy vedľa seba; riadky, ktoré sa líšia, sú zvýraznené.

Bayesian NSGA-II×Multi-Objective Genetic Algorithm (MOGA)×
OdborSimuláciaSimulácia
RodinaProcess / pipelineProcess / pipeline
Rok vzniku2002–20061984
TvorcaEmmerich, M. T. M. et al. (surrogate-assisted MO-EA); Deb et al. (NSGA-II base)Schaffer, J. D. (early MOGA); Goldberg, D. E. (GA foundations)
TypSurrogate-assisted multi-objective evolutionary algorithmPopulation-based evolutionary optimizer
Pôvodný zdrojDeb, K., Pratap, A., Agarwal, S., Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182–197. DOI ↗Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673
Ďalšie názvyB-NSGA-II, Surrogate-Assisted NSGA-II, Gaussian Process NSGA-II, Bayesian Multi-Objective EAMOGA, Multi-objective GA, Evolutionary multi-objective optimization, EMO
Príbuzné34
ZhrnutieBayesian NSGA-II integrates Gaussian process surrogate models (Bayesian metamodels) into the NSGA-II evolutionary loop to solve expensive multi-objective optimization problems. By replacing costly true function evaluations with fast probabilistic predictions, it discovers high-quality Pareto-front approximations with far fewer real evaluations than standard NSGA-II.A Multi-Objective Genetic Algorithm (MOGA) is an evolutionary computation method that evolves a population of candidate solutions toward a Pareto-optimal front, simultaneously optimizing two or more conflicting objective functions. It avoids collapsing trade-offs into a single score, instead producing a set of non-dominated solutions for the decision-maker to choose among.
ScholarGateDátová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Prejsť na hľadanie Stiahnuť snímky

ScholarGatePorovnať metódy: Bayesian NSGA-II · Multi-objective genetic algorithm. Získané 2026-06-15 z https://scholargate.app/sk/compare