.png){kind=icon}
返回
Autoencoder evolutionary algorithm for large-scale multi-objective optimization problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-024-02221-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-objective optimization problems characterized by a substantial number of decision variables, which are also called large-scale multi-objective optimization problems (LSMOPs), are becoming increasingly prevalent. Traditional evolutionary algorithms may deteriorate drastically when tackling a large number of decision variables. For LSMOPs, the dimensionality of the decision variables needs to be reduced and the algorithm needs to be designed according to the characteristics of divide-and-conquer. The autoencoder evolutionary algorithm (AEEA) is proposed based on autoencoder dimensionality reduction, the grouping of decision variables, and the application of divide-and-conquer strategies. The proposed algorithm is compared with other classical algorithms. The experiment result shows that AEEA achieves excellent convergence and diversity, and still performs well in decision variables of higher dimensions. Finally, it is verified that the autoencoder improves the running time of the proposed algorithm.
Keyword:
Large-scale
Multi-objective optimization
Evolutionary algorithms
Dimensionality reduction
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
分享收藏Evaluating the Epithelial-Mesenchymal Program in Human Breast Epithelial Cells Cultured in Soft Agar Using a Novel Macromolecule Extraction Protocol.png)
Cancers
OAAI
CancersIF0
OAAI分享收藏Cooperative Co-Evolution With Differential Grouping for Large Scale Optimization面向大规模优化的差分分组协同进化算法
OAAI
OAAI分享收藏
查看更多内容