Merge Nondominated Sorting Algorithm for Many-Objective Optimization

IEEE Transactions on Cybernetics(2021)

引用 13|浏览103
暂无评分
摘要
Many Pareto-based multiobjective evolutionary algorithms require ranking the solutions of the population in each iteration according to the dominance principle, which can become a costly operation particularly in the case of dealing with many-objective optimization problems. In this article, we present a new efficient algorithm for computing the nondominated sorting procedure, called merge nondomi...
更多
查看译文
关键词
Sociology,Statistics,Sorting,Optimization,Computational complexity,Data structures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要