返回
Solution Representation Learning in Multi-Objective Transfer Evolutionary Optimization
DOI:10.1109/ACCESS.2021.3065741.png)
摘要
En 中文
This paper presents a first study on solution representation learning for inducing greater alignment and hence positive transfers between distinct multi-objective optimization tasks that bear discrepancies in their original search spaces. We first establish a novel probabilistic model-based multi-objective transfer evolutionary optimization (TrEO) framework with solution representation learning, capable of activating positive transfers while simultaneously curbing the threat of negative transfers. In particular, well-aligned solution representations are learned via spatial transformations to handle mismatches in search space dimensionalities between distinct multi-objective problems, as well as to increase the overlap between their optimized search distributions. We then showcase different algorithmic instantiations and case studies of the proposed framework in applications spanning continuous as well as discrete optimization; illustrative examples include multi-objective engineering design and route planning of unmanned aerial vehicles. The experimental results show that our framework helps induce positive transfers by unveiling useful but hidden inter-task relationships, thus bringing about faster search convergence to solutions of high quality in multi-objective TrEO.
Keyword:
Optimization
Task analysis
Probabilistic logic
Search problems
Sociology
Adaptation models
Mixture models
Transfer evolutionary optimization
solution representation learning
multi-objective optimization
probabilistic model-based search
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
32.9W
机构
引用论文
Multitasking Multiobjective Evolutionary Operational Indices Optimization of Beneficiation Processes
Affine Transformation-Enhanced Multifactorial Optimization for Heterogeneous Problems仿射变换-异构问题的增强多因子优化
Compressed representation for higher-level meme space evolution: a case study on big knapsack problems
MEMETIC COMPUTING
IF2.3

