Process / pipelineSimulation / optimization
多目标遗传算法 (MOGA) — 帕累托最优解的进化搜索
多目标遗传算法 (MOGA) 是一种进化计算方法,它通过进化候选解种群来趋近帕累托最优前沿,同时优化两个或多个相互冲突的目标函数。它避免了将权衡折叠成单一分数,而是产生一组非支配解供决策者选择。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
+9 more
来源
- Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673
- Deb, 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: 10.1109/4235.996017 ↗
如何引用本页
ScholarGate. (2026, June 3). Multi-Objective Genetic Algorithm (MOGA). ScholarGate. https://scholargate.app/zh/simulation/multi-objective-genetic-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →