A Surrogate-Assisted Many-Objective Evolutionary Algorithm Using Multi- Classification and Coevolution for Expensive Optimization Problems
Ruoyu Wang, Yuee Zhou, Hanning Chen and 2 more
IEEE Access · 2021
doi:10.1109/access.2021.3131587 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Surrogate-assisted evolutionary algorithms have received a surge of attentions for their promising ability of solving expensive optimization problems. Existing surrogate-assisted evolutionary algorithms usually adopt the regression models and the binary classification models to guide the evolution of the population for solving the multiobjective optimization problems. However, the regression models will make the algorithm to be increasingly computation-expensive as the number of objectives increases, while the use of the binary classification models might suffer from the poor diversity since the diversified information of solutions cannot be reflected in these classification models. For this issue, this paper proposes a surrogate-assisted many-objective evolutionary algorithm using the cooperation of the multi-classification and regression models to improve the search quality while reducing the computational cost. Our approach includes two parts: At the model training stage, a multi-classification model is constructed to divide the whole population into several classes for ensuring diversity, a distance regression model and an angle regression model are used to select solutions with better convergence and diversity in each class; At the evolution stage, a coevolutionary framework is used to guide the evolution according to a new selection criterion. Experimental results verify the effectiveness of the proposed algorithm on a set of expensive test problems with up to 10 objectives.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.