This paper proposes genetic algorithms using tournamentselection, niche count, and violation degree to solve this problem.
该算法采用了两两竞赛的选择算子、聚集度、违约度来处理多目标约束优化。
2
Elitism and 2-tournamentselection are used to expand the selection of chromosomes, so that the ones with better fitness have more chances to be selected.