Running Time Analysis of MOEA/D on Pseudo-Boolean Functions
IEEE Transactions on Cybernetics(2021)
摘要
Decomposition-based multiobjective evolutionary algorithms (MOEAs) are a class of popular methods for solving the multiobjective optimization problems (MOPs), and have been widely studied in numerical experiments and successfully applied in practice. However, we know little about these algorithms from the theoretical aspect. In this paper, we present running time analysis of a simple MOEA with mut...
更多查看译文
关键词
Optimization,Upper bound,Computer science,Indexes,Cybernetics,Evolutionary computation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络