返回
Evolutionary Large-Scale Multiobjective Optimization via Autoencoder-Based Problem Transformation
DOI:10.1109/TETCI.2024.3369629.png)
摘要
En 中文
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(3) to 10(4). The comparative results demonstrate the advantages of our proposed optimizer in solving these LMOPs with a limited budget of 10(5) function evaluations.
Keyword:
Evolutionary algorithm
large-scale multiobjective optimization
autoencoder
problem transformation
期刊
I
IF:
6.5
论文数:
1.4K
被引数:
4.5K
机构
引用论文
A random dynamic grouping based weight optimization framework for large-scale multi-objective optimization problems基于随机动态分组的大规模多目标优化问题权重优化框架
An Enhanced Competitive Swarm Optimizer With Strongly Convex Sparse Operator for Large-Scale Multiobjective Optimization用于大规模多目标优化的具有强凸稀疏算子的增强型竞争群优化器

