A Hybrid Deep Grouping Algorithm for Large Scale Global Optimization

Haiyan Liu

doi:10.1109/TEVC.2020.2985672

Return

A Hybrid Deep Grouping Algorithm for Large Scale Global Optimization

2020-12-01

PRE

Haiyan Liu

Yuping Wang *

Ninglei Fan

DOI：10.1109/TEVC.2020.2985672

Original

Original request for help

Save

Abstract

En 中文

Many real-world problems contain a large number of decision variables which can be modeled as large scale global optimization (LSGO) problems. One effective way to solve an LSGO problem is to decompose it into smaller subproblems to solve. The existing works mainly focused on designing methods to decompose separable problems, while seldom focused on the decomposition of nonseparable large scale problems. Also, the existing decomposition methods only learn the interaction (correlation or interdependence) among variables to make the decomposition. In this article, we make the decomposition deeper: we not only consider the variable interaction but also take the essentialness of the variable into account to form a deep grouping method. To do this, we first design an essential/trivial variable detection scheme to support the deep decomposition for both separable problems and nonseparable problems. Based on it, we propose a new decomposition method called deep grouping method. Then, we design a new differential evolution (DE) algorithm with a new mutation strategy. By integrating all these, we propose a hybrid deep grouping (HDG) algorithm. Finally, the experiments are conducted on the widely used and most challenging LSGO benchmark suites, and the comparison results of the proposed algorithm with the state-of-the-art algorithms indicate the proposed algorithm is more effective.

Keywords:

Optimization

Correlation

Computer science

Fans

Benchmark testing

Search problems

Entropy

Decomposition (grouping) strategy

deep grouping

large scale optimization

problem decomposition