An improved regularity-based vector evolutionary algorithm for multi-objective optimizations

Yiying Li

doi:10.1016/j.advengsoft.2022.103397

2023-02-01

PRE

Yiying Li

Shiyou Yang *

DOI：10.1016/j.advengsoft.2022.103397

原文链接

原文求助

摘要

En 中文

Inverse models-based evolutionary algorithms can generate as many solutions as required in interest regions at a low budget cost. However, the objective value used for the inverse model in the original regularity-based al-gorithm using Gaussian process-based inverse models, (IM-MOEA), is linearly and separately sampled for each objective according to its maximum and minimum values so far searched. Consequently, some non-optimal even infeasible solutions may be sampled. Also, the number of the predefined reference vectors remains constant throughout the whole evolution. Consequently, it may result in a low computational efficiency for multi-objective optimization ones (MOOs) with nonuniform or disconnected Pareto fronts. In this respect, an improved regularity-based vector evolutionary algorithm for multi-objective optimizations is presented in the paper. The main component of the proposed algorithm is to obtain the training data for inverse models by interpolation in the objective space. The population is divided into subpopulations according to the number of objectives. The non-dominated solutions are utilized for interpolations in each subpopulation. The inverse models are finally used to generate offspring using data by interpolation. An adaptive interpolation range co-efficient is proposed for adaptive adjustments of the interpolation region to balance the exploitation and the exploration searches. An elite strategy of hiring elite individuals in the whole population to the current sub-population is employed to enhance the algorithm convergence. Experimental results on two test suites show the superiority of the proposed algorithm.

Keyword:

Evolutionary algorithm

Multi-objective optimization problem

Interpolation

Inverse models