.png){kind=icon}
返回
Improved solution to the non-domination level update problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.asoc.2017.06.038.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present two approaches for non-domination level update problem. The first one is a space efficient non-domination level update (SENLU) approach. The second one is a binary search tree based efficient non-domination level update (BST-ENLU) approach which uses the basic property of binary search tree. Although the space complexity of BST-ENLU approach is higher than SENLU approach in caseof insertion, but in terms of number of dominance comparisons, BST-ENLU approach can outperform SENLU approach. Thus, these two approaches are complementary to each other. The comparative results show that in case where all the solutions are in different fronts, the maximum number of dominance comparisons using BST-ENLU approach is very less than ENLU approach. A tree based approach is introduced to identify the correct position of the solution to be deleted efficiently. Also a theoretical upper bound to the maximum number of dominance comparisons is obtained for both the proposed approaches in case of both insertion and deletion operations. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Evolutionary algorithms
NSGA-II
Non-dominated sorting
Non-domination level update problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏Post‐stroke depression and functional recovery in a population‐based stroke register. The Finnstroke study基于人群的卒中登记中的卒中后抑郁和功能恢复。Finnstroke研究
PREAI
分享收藏
Monodisperse single-crystal mesoporous magnetite nanoparticles induced by nanoscale gas bubbles
PREAI
分享收藏
查看更多内容