进化算法
进化计算
计算机科学
可扩展性
多目标优化
背景(考古学)
最优化问题
选择(遗传算法)
数学优化
领域(数学)
人工智能
机器学习
数学
算法
古生物学
数据库
纯数学
生物
作者
Songbai Liu,Qiuzhen Lin,Jianqiang Li,Kay Chen Tan
标识
DOI:10.1109/tevc.2023.3250350
摘要
Recent decades have witnessed great advancements in multiobjective evolutionary algorithms (MOEAs) for multiobjective optimization problems (MOPs).However, these progressively improved MOEAs have not necessarily been equipped with scalable and learnable problem-solving strategies for new and grand challenges brought by the scaling-up MOPs with continuously increasing complexity from diverse aspects, mainly including expensive cost of function evaluations, many objectives, large-scale search space, time-varying environments, and multitask.Under different scenarios, divergent thinking is required in designing new powerful MOEAs for solving them effectively.In this context, research studies on learnable MOEAs with machine learning techniques have received extensive attention in the field of evolutionary computation.This paper begins with a general taxonomy of scaling-up MOPs and learnable MOEAs, followed by an analysis of the challenges that these MOPs pose to traditional MOEAs.Then, we synthetically overview recent advances of learnable MOEAs in solving various scaling-up MOPs, focusing primarily on four attractive directions (i.e., learnable evolutionary discriminators for environmental selection, learnable evolutionary generators for reproduction, learnable evolutionary evaluators for function evaluations, and learnable evolutionary transfer modules for sharing or reusing optimization experience).The insight of learnable MOEAs is offered to readers as a reference to the general track of the efforts in this field.
科研通智能强力驱动
Strongly Powered by AbleSci AI