.png){kind=icon}
返回
Generalized Multitasking for Evolutionary Optimization of Expensive Problems
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2017.2785351.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Conventional evolutionary algorithms (EAs) are not well suited for solving expensive optimization problems due to the fact that they often require a large number of fitness evaluations to obtain acceptable solutions. To alleviate the difficulty, this paper presents a multitasking evolutionary optimization framework for solving computationally expensive problems. In the framework, knowledge is transferred from a number of computationally cheap optimization problems to help the solution of the expensive problem on the basis of the recently proposed multifactorial EA (MFEA), leading to a faster convergence of the expensive problem. However, existing MFEAs do not work well in solving multitasking problems whose optimums do not lie in the same location or when the dimensions of the decision space are not the same. To address the above issues, the existing MFEA is generalized by proposing two strategies, one for decision variable translation and the other for decision variable shuffling, to facilitate knowledge transfer between optimization problems having different locations of the optimums and different numbers of decision variables. To assess the effectiveness of the generalized MFEA (G-MFEA), empirical studies have been conducted on eight multitasking instances and eight test problems for expensive optimization. The experimental results demonstrate that the proposed G-MFEA works more efficiently for multitasking optimization and successfully accelerates the convergence of expensive optimization problems compared to single-task optimization.
Keyword:
Evolutionary algorithms (EAs)
evolutionary multitasking optimization
expensive optimization
knowledge transfer
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
ParEGO: A hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problemsParEGO: 一种具有在线景观逼近的混合算法，用于解决昂贵的多目标优化问题
.png){kind=icon}
PREAI
分享收藏Data-Driven Surrogate-Assisted Multiobjective Evolutionary Optimization of a Trauma System创伤系统的数据驱动代理辅助多目标进化优化OAAI
OAAI分享收藏
查看更多内容