2005 | OriginalPaper | Chapter
The Naive IDA: A Baseline Multi–objective EA
Authors : Peter A. N. Bosman, Dirk Thierens
Published in: Evolutionary Multi-Criterion Optimization
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Estimation of distribution algorithms have been shown to perform well on a wide variety of single–objective optimization problems. Here, we look at a simple – yet effective – extension of this paradigm for multi–objective optimization, called the naive
${\mathbb M}$
ID
${\mathbb E}$
A. The probabilistic model in this specific algorithm is a mixture distribution, and each component in the mixture is a univariate factorization. Mixture distributions allow for wide–spread exploration of the Pareto front thus aiding the important preservation of diversity in multi–objective optimization. Due to its simplicity, speed, and effectiveness the naive
${\mathbb M}$
ID
${\mathbb E}$
A can well serve as a baseline algorithm for multi–objective evolutionary algorithms.