mathematical-theory
非支配排序遗传算法II
Non-dominated Sorting Genetic Algorithm IIA widely used multi-objective evolutionary algorithm based on Pareto dominance and non-dominated sorting. / 基于帕累托支配和非支配排序的广泛使用的多目标进化算法。
- Knowledge type
- 数学理论
- First proposed or discovered
- 2002
- Proposer
- Kalyanmoy Deb
- Creator
- 农场主
- Last updated
- 2026-10-28 17:01:29
Sub-knowledge points
Fast non-dominated sortingCrowding distance assignmentEnvironmental selection
Higher-order knowledge points
Multi-objective optimizationEvolutionary computation
Main parameters and performance indicators
population size: Number of individuals in the populationcrossover probability: Probability of crossover operationmutation probability: Probability of mutation operationcrossover operator: Operator used for crossover (e.g., SBX)mutation operator: Operator used for mutation (e.g., polynomial mutation)
Open problems
Scalability to very high-dimensional problemsPremature convergence in complex landscapes
Related literature
ranked by community starsAn enhanced NSGA-II with Q-learning and VNS for multi-objective scheduling in additive manufacturingOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Non-dominated Sorting Genetic Algorithm II.
Node update feedback
review required