.png){kind=icon}
返回
Divide-and-conquer based non-dominated sorting with Reduced Comparisons
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2019.100580.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Non-dominated sorting has attracted a lot of attention of the research community due to its use in solving multi- and many-objective optimization problems. In recent years, several approaches for non-dominated sorting have been proposed. In this paper, we have developed a non-dominated sorting framework, namely DCNSRC (Divide-and-Conquer based Non-dominated Sorting with Reduced Comparisons). Based on this framework, two approaches have been proposed by varying the search technique. These approaches perform a lower number of dominance comparisons than various other approaches. The duplicate solutions are also handled efficiently. These approaches save various comparisons while comparing the two solutions. The proposed approaches are validated using some theoretical analyses. The number of dominance comparisons performed by the proposed framework are theoretically analyzed in three different scenarios, both in the worst and the best cases. Experimental results on synthetic datasets and the benchmark problems show the superiority of the proposed approach over state-of-the-art algorithms.
Keyword:
Evolutionary algorithm
Non-dominating sorting
Time complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
查看更多内容