An Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization
Xingyi Zhang, Ye Tian, Ran Cheng, Yaochu Jin
Anhui University University of Surrey
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Evolutionary algorithms have been shown to be powerful for solving multiobjective optimization problems, in which nondominated sorting is a widely adopted technique in selection. This technique, however, can be computationally expensive, especially when the number of individuals in the population becomes large. This is mainly because in most existing nondominated sorting algorithms, a solution needs to be compared with all other solutions before it can be assigned to a front. In this paper we propose a novel, computationally efficient approach to nondominated sorting, termed efficient nondominated sort (ENS). In ENS, a solution to be assigned to a front needs to be compared only with those that have already been assigned to a front, thereby avoiding many unnecessary dominance comparisons. Based on this new approach, two nondominated sorting algorithms have been suggested. Both theoretical analysis and empirical results show that the ENS-based sorting algorithms are computationally more efficient than the state-of-the-art nondominated sorting methods.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIAdvanced Multi-Objective Optimization Algorithms
Metaheuristic Optimization Algorithms Research · Evolutionary Algorithms and Applications
参考文献 24
此处列出前 3 条
引用本文 544
按被引量排序,此处列出前 3 条