Sign up
Forgot password?
FAQ: Login

Schütze O., Hernández C. Archiving Strategies for Evolutionary Multi-objective Optimization Algorithms

  • pdf file
  • size 17,33 MB
  • added by
  • info modified
Schütze O., Hernández C. Archiving Strategies for Evolutionary Multi-objective Optimization Algorithms
Springer, 2021. — 242 p. — (Studies in Computational Intelligence 938). — ISBN: 978-3-030-63772-9.
This book presents an overview of archiving strategies developed over the last years by the authors that deal with suitable approximations of the sets of optimal and nearly optimal solutions of multi-objective optimization problems by means of stochastic search algorithms. All presented archivers are analyzed with respect to the approximation qualities of the limit archives that they generate and the upper bounds of the archive sizes.
The convergence analysis will be done using a very broad framework that involves all existing stochastic search algorithms and that will only use minimal assumptions on the process to generate new candidate solutions. All of the presented archivers can effortlessly be coupled with any set-based multi-objective search algorithm such as multi-objective evolutionary algorithms, and the resulting hybrid method takes over the convergence properties of the chosen archiver. This book hence targets at all algorithm designers and practitioners in the field of multi-objective optimization.
Multi-objective Optimization
Archiving in Evolutionary Multi-objective Optimization: A Short Overview
The Framework
Computing the Entire Pareto Front
Computing -(approximate) Pareto Fronts
Computing Gap Free Pareto Fronts
Computing the Set of Approximate Solutions
A Short Excursion to Scalar Optimization: Computing the Set of Approximate Solutions for SOPs
Using Archivers Within MOEAs
Test Problems
Archivers
  • Sign up or login using form at top of the page to download this file.
  • Sign up
Up