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

01/02/2014
by   Zahra Pourbahman, et al.
0

The large number of exact fitness function evaluations makes evolutionary algorithms to have computational cost. In some real-world problems, reducing number of these evaluations is much more valuable even by increasing computational complexity and spending more time. To fulfill this target, we introduce an effective factor, in spite of applied factor in Adaptive Fuzzy Fitness Granulation with Non-dominated Sorting Genetic Algorithm-II, to filter out worthless individuals more precisely. Our proposed approach is compared with respect to Adaptive Fuzzy Fitness Granulation with Non-dominated Sorting Genetic Algorithm-II, using the Hyper volume and the Inverted Generational Distance performance measures. The proposed method is applied to 1 traditional and 1 state-of-the-art benchmarks with considering 3 different dimensions. From an average performance view, the results indicate that although decreasing the number of fitness evaluations leads to have performance reduction but it is not tangible compared to what we gain.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 9

01/03/2019

An Improved multi-objective genetic algorithm based on orthogonal design and adaptive clustering pruning strategy

Two important characteristics of multi-objective evolutionary algorithms...
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...
03/30/2020

SHX: Search History Driven Crossover for Real-Coded Genetic Algorithm

In evolutionary algorithms, genetic operators iteratively generate new o...
04/14/2018

On Asynchronous Non-Dominated Sorting for Steady-State Multiobjective Evolutionary Algorithms

In parallel and distributed environments, generational evolutionary algo...
03/25/2022

Rank-based Non-dominated Sorting

Non-dominated sorting is a computational bottleneck in Pareto-based mult...
05/14/2018

Triclustering of Gene Expression Microarray data using Evolutionary Approach

In Tri-clustering, a sub-matrix is being created, which exhibit highly s...
02/15/2016

Towards reducing the multidimensionality of OLAP cubes using the Evolutionary Algorithms and Factor Analysis Methods

Data Warehouses are structures with large amount of data collected from ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.