Archiving strategies for evolutionary multi-objective optimization algorithms

DOI10.1007/978-3-030-63773-6MaRDI QIDQ2218696zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 January 2021

Published in Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-63773-6

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Review text

This monograph concentrates on improving stochastic population-based methods developed for multiobjective optimization, in particular, evolutionary algorithms. Here, solving multiobjective optimization problems is understood as generating a representative set of Pareto optimal solutions. The selection of which solutions to save during the solution process of a stochastic population-based method is called archiving. The main focus of the monograph is in developing archiving strategies, also called archivers, for computing discretizations of Pareto optimal solutions with certain properties. They also consider nearly optimal solutions. Thus, both representing Pareto optimal and so-called epsilon-approximate Pareto solutions is of interest. Finally, some evolutionary multiobjective optimization methods are coupled with proposed achivers and encouraging results of the strenths of such a combination are reported. In this, one representative method of the three types of evolutionary multiobjective optimization methods is considered, that is, of dominance-based, indicator-based and decomposition-based methods. In addition, a fourth method is considered that aims to approximate the set of epsilon-Pareto optimal solutions. Many of the examples considered have only two objective functions, which enables visualizing the solutions. Some attention is also paid to benefits of achiving in single objective optimization.

Recommendations

• A multi-objective evolutionary algorithm with a separate archive
• Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results
• Online elite archiving in multi-objective particle swarm optimization
• Evolutionary Multi-Criterion Optimization
• An improved multiobjective differential evolution based on Pareto-adaptive \(\epsilon\) (Porson)-dominance and orthogonal design

Cited in

(5)

• A multi-objective evolutionary algorithm with a separate archive
• Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results
• Online elite archiving in multi-objective particle swarm optimization
• Stochastic convergence of random search methods to fixed size Pareto front approximations
• Evolutionary Multi-Criterion Optimization

This page was built for publication: Archiving strategies for evolutionary multi-objective optimization algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218696)