An Eigenspace Divide-and-Conquer Approach for Large-Scale Optimization

04/05/2020
by   Zhigang Ren, et al.
4

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 decision 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 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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/23/2021

Multi-Space Evolutionary Search for Large-Scale Optimization

In recent years, to improve the evolutionary algorithms used to solve op...
12/06/2018

A Parallel Divide-and-Conquer based Evolutionary Algorithm for Large-scale Optimization

Large-scale optimization problems that involve thousands of decision var...
12/29/2019

Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with Route Cutting Off Decomposition

The capacitated arc routing problem is a very important problem with man...
03/01/2018

A Global Information Based Adaptive Threshold for Grouping Large Scale Global Optimization Problems

By taking the idea of divide-and-conquer, cooperative coevolution (CC) p...
08/02/2020

Balancing Common Treatment and Epidemic Control in Medical Procurement during COVID-19: Transform-and-Divide Evolutionary Optimization

Balancing common disease treatment and epidemic control is a key objecti...
01/03/2019

A Constrained Cooperative Coevolution Strategy for Weights Adaptation Optimization of Heterogeneous Epidemic Spreading Networks

In this paper, the dynamic constrained optimization problem of weights a...
12/26/2021

K-Core Decomposition on Super Large Graphs with Limited Resources

K-core decomposition is a commonly used metric to analyze graph structur...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.