方法证据记录
NSGA-II
NSGA-II (Non-dominated Sorting Genetic Algorithm II) is the standard reference algorithm for multi-objective evolutionary optimisation, introduced by Deb, Pratap, Agarwal and Meyarivan in 2002. Rather than collapsing multiple conflicting objectives into a single score, it evolves a population of candidate solutions across generations and returns a set of Pareto-optimal trade-off solutions — the Pareto front — using fast non-dominated sorting and a crowding distance metric to preserve diversity.
源记录
引文逐字复制自方法源记录。这些引文不代表任何层级的验证。
Non-dominated Sorting Genetic Algorithm II
分类方法记录 · process-pipeline / optimization
- 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
- Zitzler, E., Deb, K. & Thiele, L. (2000). Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 8(2), 173-195. · DOI 10.1162/106365600568202
精选声明
声明已持久化到证据分类账中,每个声明都有自己的评估。
尚无精选声明
当分类账中没有声明时,此视图不会自行创建声明评估。
相关方法
从方法图中生成,显示为机器建议的关系 — 不推断任何证据声明。