This paper proposes genetic algorithms using tournament selection, niche count, and violation degree to solve this problem.
该算法采用了两两竞赛的选择算子、聚集度、违约度来处理多目标约束优化。
Elitism and 2-tournament selection are used to expand the selection of chromosomes, so that the ones with better fitness have more chances to be selected.
改进后的算法在选择操作时，采取了精英个体保留策略和锦标赛方法，扩大染色体的选择范围，加大了适应度好的染色体被选中的概率；
Elitism and 2-tournament selection are used to expand the selection of chromosomes, so that the ones with better fitness have more chances to be selected.
改进后的算法在选择操作时，采取了精英个体保留策略和锦标赛方法，扩大染色体的选择范围，加大了适应度好的染色体被选中的概率；
应用推荐