4.6 Article

A classification tree and decomposition based multi-objective evolutionary algorithm with adaptive operator selection

期刊

COMPLEX & INTELLIGENT SYSTEMS
卷 9, 期 1, 页码 579-596

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s40747-022-00812-8

关键词

Multi-objective optimization; Adaptive operator selection; Classification tree; Search inertia

向作者/读者索取更多资源

This study proposes a novel classification tree based adaptive operator selection strategy and designs a new differential evolution algorithm to improve the performance of multi-objective evolutionary algorithms. The experimental results demonstrate that the proposed approach outperforms other variants in benchmark tests.
Adaptive operator selection (AOS) is used to dynamically select the appropriate genic operator for offspring reproduction, which aims to improve the performance of evolutionary algorithms (EAs) by producing high-quality offspring during the evolutionary process. This paper proposes a novel classification tree based adaptive operator selection strategy for multi-objective evolutionary algorithm based on decomposition (MOEA/D-CTAOS). In our proposal, the classification tree is trained by the recorded data set which contains the information on the historical offspring. Before the reproduction at each generation, the classifier is used to predict each possible result obtained by different operators, and only one operator with the best result is selected to generate offspring next. Meanwhile, a novel differential evolution based on search inertia (SiDE) is designed to steer the evolutionary process in a more efficient way. The experimental results demonstrate that proposed MOEA/D-CTAOS outperforms other MOEA/D variants on UF and LZ benchmarks in terms of IGD and HV value. Further investigation also confirms the advantage of direction-guided search strategy in SiDE.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据