A Genetic Optimization Algorithm Based on Adaptive Dimensionality Reduction

Abstract EN

With the rise of big data in cloud computing, many optimization problems have gradually developed into high-dimensional large-scale optimization problems.

In order to address the problem of dimensionality in optimization for genetic algorithms, an adaptive dimensionality reduction genetic optimization algorithm (ADRGA) is proposed.

An adaptive vector angle factor is introduced in the algorithm.

When the angle of an individual’s adjacent dimension is less than the angle factor, the value of the smaller dimension is marked as 0.

Then, the angle between each individual dimension is calculated separately, and the number of zeros in the population is updated.

When the number of zeros of all individuals in a population exceeds a given constant in a certain dimension, the dimension is considered to have no more information and deleted.

Eight high-dimensional test functions are used to verify the proposed adaptive dimensionality reduction genetic optimization algorithm.

The experimental results show that the convergence, accuracy, and speed of the proposed algorithm are better than those of the standard genetic algorithm (GA), the hybrid genetic and simulated annealing algorithm (HGSA), and the adaptive genetic algorithm (AGA).