跳到主要导航 跳到搜索 跳到主要内容

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

  • Zhigang Ren
  • , Yongsheng Liang
  • , Muyi Wang
  • , Yang Yang
  • , An Chen
  • Xi'an Jiaotong University

科研成果: 期刊稿件 › 文章 › 同行评审

10 引用 (Scopus)

摘要

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.

源语言英语
期刊论文编号106911
期刊Applied Soft Computing Journal
卷99
DOI
出版状态已出版 - 2月 2021

学术指纹

探究 'An eigenspace divide-and-conquer approach for large-scale optimization' 的科研主题。它们共同构成独一无二的学术指纹。

引用此