返回
Solving multi-objective optimization problem using cuckoo search algorithm based on decomposition
DOI:10.1007/s10489-020-01816-y.png)
摘要
En 中文
In recent years, cuckoo search (CS) algorithm has been successfully applied in single-objective optimization problems. In addition, decomposition-based multi-objective evolutionary algorithms (MOEA/D) have high performance for multi-objective optimization problems (MOPs). Inspired by this, a new decomposition-based multi-objective CS algorithm is proposed in this paper. Two reproduction operators with different characteristics derived from the CS algorithm are constructed and they compose an operator pool. Then, a bandit-based adaptive operator selection method is used to determine the application of different operators. An angle-based selection strategy that achieves a better balance between convergence and diversity is adopted to preserve diversity. Compared with other improved strategies designed for MOEA/D on two suits of test instances, the proposed algorithm was demonstrated to be effective and competitive for MOPs.
Keyword:
Cuckoo search
Multi-objective
Decomposition
Angle-based selection
Adaptive operator selection
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
暂无机构信息
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法

