A novel solver for multi-objective optimization: dynamic non-dominated sorting genetic algorithm (DNSGA)
Qiang Long, Guoquan Li, Lin Jiang
Southwest University of Science and Technology Chongqing Normal University Curtin University
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Non-dominated sorting is a critical component of all multi-objective evolutionary algorithms (MOEAs). A large percentage of computational cost of MOEAs is spent on non-dominated sorting. So the complexity of non-dominated sorting method in a large extent decides the efficiency of the MOEA. In this paper, we present a novel non-dominated sorting method called the dynamic non-dominated sorting (DNS). It is based on the sorting of each objective instead of dominance comparisons. The computational compelxity of DNS is $O(mN\log N)$ ($m$ is the number of objectives, $N$ is the population size), which equals to the best record so far. Based on DNS, we introduce a novel multi-objective genetic algorithm (MOGA) called the dynamic non-dominated sorting genetic algorithm (DSGA). Then, some numerical comparisons between different non-dominated sorting method are presented. The results shows that DNS is efficient and promising. Finally, numerical experiments on DSGA are also given. The results show that DSGA outperforms some other MOEAs both on general-scale and large-scale multi-objective problems.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIAdvanced Multi-Objective Optimization Algorithms
Metaheuristic Optimization Algorithms Research · Evolutionary Algorithms and Applications