Multiobjective hBOA, Clustering, and Scalability

02/07/2005
by   Martin Pelikan, et al.
0

This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominated sorting genetic algorithm (NSGA-II) and clustering in the objective space. It is first argued that for good scalability, clustering or some other form of niching in the objective space is necessary and the size of each niche should be approximately equal. Multiobjective hBOA (mohBOA) is then described that combines hBOA, NSGA-II and clustering in the objective space. The algorithm mohBOA differs from the multiobjective variants of BOA and hBOA proposed in the past by including clustering in the objective space and allocating an approximately equally sized portion of the population to each cluster. The algorithm mohBOA is shown to scale up well on a number of problems on which standard multiobjective evolutionary algorithms perform poorly.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2015

A Java Implementation of Parameter-less Evolutionary Algorithms

The Parameter-less Genetic Algorithm was first presented by Harik and Lo...
research
02/15/2004

Parameter-less hierarchical BOA

The parameter-less hierarchical Bayesian optimization algorithm (hBOA) e...
research
06/26/2015

A Java Implementation of the SGA, UMDA, ECGA, and HBOA

The Simple Genetic Algorithm, the Univariate Marginal Distribution Algor...
research
03/22/2022

Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection

Evolutionary algorithms (EAs) have been widely used to solve multi-objec...
research
01/02/2014

Reducing the Computational Cost in Multi-objective Evolutionary Algorithms by Filtering Worthless Individuals

The large number of exact fitness function evaluations makes evolutionar...
research
06/19/2015

Design of OFDM radar pulses using genetic algorithm based techniques

The merit of evolutionary algorithms (EA) to solve convex optimization p...
research
10/29/2020

Attentive Clustering Processes

Amortized approaches to clustering have recently received renewed attent...

Please sign up or login with your details

Forgot password? Click here to reset