arrow
返回

An eigenspace divide-and-conquer approach for large-scale optimization

delete2021-02-01
delete7
delete
OA
AI
Z
Zhigang Ren *
Y
Yongsheng Liang
M
Muyi Wang
Y
Yang Yang
A
An Chen
DOI:10.1016/j.asoc.2020.106911delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Divide-and-conquer-based (DC-based) evolutionary algorithms (EAs) have achieved notable success in dealing with large-scale optimization problems (LSOPs). However, the appealing performance of this type of algorithms generally requires a high-precision decomposition of the optimization problem, which is still a challenging task for existing decomposition methods. This study attempts to address the above issue from a different perspective and proposes an eigenspace divide-and-conquer (EDC) approach. Different from existing DC-based algorithms that perform decomposition and optimization in the original solution space, EDC first establishes an eigenspace by conducting singular value decomposition on a set of high-quality solutions selected from recent generations. Then it transforms the optimization problem into the eigenspace, and thus significantly weakens the dependencies among the corresponding eigenvariables. Accordingly, these eigenvariables can be efficiently grouped by a simple random decomposition strategy and each of the resulting subproblems can be addressed more easily by a traditional EA. To verify the efficiency of EDC, comprehensive experimental studies were conducted on two sets of benchmark functions. Experimental results indicate that EDC is robust to its parameters and has good scalability to the problem dimension. The comparison with several state-of-the-art algorithms further confirms that EDC is pretty competitive and performs better on complicated LSOPs. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Large-scale optimization
Eigenspace divide-and-conquer
Space transformation
Variable dependency
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

X
xi'an jiaotong university
学者数:
9.3W
论文数: 6.7W
被引数: 75
引用论文

引用论文

An Expert Simulation System for Soybean Insect Pest Management
err1989-01-01
err0
PREAI
errW. D. Batchelor; R. W. McClendon; J. W. Jones; D. B. Adams
err分享
err收藏
A cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem多车场车辆路径问题的协同进化算法
err2016-01-01
err81
errOAAI
errde Oliveira, Fernando Bernardes; Enayatifar, Rasul; Sadaei, Hossein Javedani; Guimaraes, Frederico Gadelha; Potvin, Jean-Yves
err分享
err收藏
Segment-Based Predominant Learning Swarm Optimizer for Large-Scale Optimization用于大规模优化的基于分段的优势学习群优化器
err2017-09-01
err115
errOAAI
errYang, Qiang; Chen, Wei-Neng; Gu, Tianlong; Zhang, Huaxiang; Deng, Jeremiah D.; Li, Yun; Zhang, Jun
err分享
err收藏
err分享
err收藏
err分享
err收藏
A Survey on Cooperative Co-Evolutionary Algorithms协作式协同进化算法研究综述
err2019-06-01
err212
PREAI
errMa, Xiaoliang; Li, Xiaodong; Zhang, Qingfu; Tang, Ke; Liang, Zhengping; Xie, Weixin; Zhu, Zexuan
err分享
err收藏
Similarities and differences in wheat plant responses to low temperature and cadmium
err2015-11-19
err0
PREAI
errYu. V. Venzhik; V. V. Talanova; A. F. Titov; E. S. Kholoptseva
err分享
err收藏
学者 查看更多内容