Evolutionary Large-Scale Multiobjective Optimization via Autoencoder-Based Problem Transformation

Addressing the challenge of efficiently handling high-dimensional search spaces in solving large-scale multiobjective optimization problems (LMOPs) becomes an emerging research topic in evolutionary computation. In response, this paper proposes a new evolutionary optimizer with a tactic of autoencoder-based problem transformation (APT). The APT involves creating an autoencoder to learn the relative importance of each variable by competitively reconstructing the dominated and non-dominated solutions. Using the learned importance, all variables are divided into multiple groups without consuming any function evaluations. The number of groups dynamically increases according to the population's evolutionary status. Each variable group has an associated autoencoder, transforming the search space into an adaptable small-scale representation space. Thus, the search process occurs within these dynamic representation spaces, leading to effective production of offspring solutions. To assess the effectiveness of APT, extensive testing is performed on benchmark suites and real-world LMOPs, encompassing variable sizes ranging from 10
³
to 10
⁴
. The comparative results demonstrate the advantages of our proposed optimizer in solving these LMOPs with a limited budget of 10
⁵
function evaluations.