返回
Convergence of Hypervolume-Based Archiving Algorithms
DOI:10.1109/TEVC.2014.2341711.png)
摘要
En 中文
Multiobjective evolutionary algorithms typically maintain a set of solutions. A crucial part of these algorithms is the archiving, which decides what solutions to keep. A (mu + lambda)archiving algorithm defines how to choose in each generation mu children from mu parents and lambda offspring together. We study mathematically the convergence behavior of hypervolume-based archiving algorithms. We distinguish two cases for the offspring generation. A best-case view leads to a study of the effectiveness of archiving algorithms. It was known that all (mu + 1)-archiving algorithms are ineffective, which means that a set with maximum hypervolume is not necessarily reached. We prove that for lambda < mu, all archiving algorithms are ineffective. We also present upper and lower bounds for the achievable hypervolume for different classes of archiving algorithms. On the other hand, a worst-case view on the offspring generation leads to a study of the competitive ratio of archiving algorithms. This measures how much smaller hypervolumes are achieved due to not knowing the future offspring in advance. We present upper and lower bounds on the competitive ratio of different archiving algorithms and present an archiving algorithm, which is the first known computationally efficient archiving algorithm with constant competitive ratio.
Keyword:
Hypervolume indicator
multiobjective optimization
optimization methods
performance measures
selection
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
Looking inside phytoplasma-infected sieve elements: A combined microscopy approach using Arabidopsis thaliana as a model plant
Micron
IF0

