.png){kind=icon}
返回
A novel non-dominated sorting algorithm for evolutionary multi-objective optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.jocs.2017.09.015.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Evolutionary computation has shown great performance in solving many multi-objective optimization problems; in many such algorithms, non-dominated sorting plays an important role in determining the relative quality of solutions in a population. However, the implementation of non-dominated-sorting can be computationally expensive, especially for populations with a large number of solutions and many objectives. The main reason is that most existing non-dominated sorting algorithms need to compare one solution with almost all others to determine its front, and many of these comparisons are redundant or unnecessary. Another reason is that as the number of objectives increases, more and more candidate solutions become non-dominated solutions, and most existing time-saving approaches cannot work effectively. In this paper, we present a novel non-dominated sorting strategy, called Hierarchical Non Dominated Sorting (HNDS). HNDS first sorts all candidate solutions in ascending order by their first objective. Then it compares the first solution with all others one by one to make a rapid distinction between different quality solutions, thereby avoiding many unnecessary comparisons. Experiments on populations with different numbers of solutions, different numbers of objectives and different problems have been done. The results show that HNDS has better computational efficiency than fast non-dominated sort, Arena's principle and deductive sort. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Multi-objective evolutionary algorithm
Non-dominated sort
Pareto front
Computational complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
18.3
论文数:
3.1K
被引数:
4.0K
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
.png){kind=icon}
PREAI
分享收藏分享收藏分享收藏
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints使用基于参考点的非支配排序方法的进化多目标优化算法，第一部分: 解决框约束问题
PREAI
分享收藏
查看更多内容