Evolutionary Many-Objective Optimization

GECCO '19: Genetic and Evolutionary Computation Conference Prague Czech Republic July, 2019(2008)

引用 1250|浏览609
暂无评分
摘要
In this paper, we first explain why many-objective problems are difficult for Pareto dominance-based evolutionary multiobjective optimization algorithms such as NSGA-H and SPEA. Then we explain recent proposals for the handling of many-objective problems by evolutionary algorithms. Some proposals are examined through computational experiments on multiobjective knapsack problems with two, four and six objectives. Finally we discuss the viability of many-objective genetic fuzzy systems (i.e., the use of many-objective genetic algorithms for the design of fuzzy rule-based systems).
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要