Name
Abstract | ||
|---|---|---|
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 (μ + λ)archiving algorithm defines how to choose in each generation μ children from μ parents and λ 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 (μ + 1)-archiving algorithms are ineffective, which means that a set with maximum hypervolume is not necessarily reached. We prove that for λ <; μ, 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 worstcase 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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TEVC.2014.2341711 | Evolutionary Computation, IEEE Transactions |
Keywords | Field | DocType |
convergence,evolutionary computation,competitive ratio,convergence behavior,hypervolume-based archiving algorithms,multiobjective evolutionary algorithm,offspring generation,Hypervolume indicator,multiobjective optimization,optimization methods,performance measures,selection | Convergence (routing),Mathematical optimization,Computer science,Theoretical computer science,Artificial intelligence,Machine learning | Journal |
Volume | Issue | ISSN |
18 | 5 | 1089-778X |
Citations | PageRank | References |
5 | 0.41 | 21 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Karl Bringmann | 1 | 427 | 30.13 |
| Tobias Friedrich | 2 | 457 | 23.56 |