Improved Differential Evolution for Large-Scale Black-Box Optimization

The demand for solving large-scale complex problems continues to grow. Many real-world problems are described by a large number of variables that interact with each other in a complex way. The dimensionality of the problem has a direct impact on the computational cost of the optimization. During the...

Full description

Bibliographic Details
Main Authors: Mirjam Sepesy Maucec, Janez Brest, Borko Boskovic, Zdravko kacic
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8369087/
id doaj-1a5159a4468f435fa639337cbf17903b
record_format Article
spelling doaj-1a5159a4468f435fa639337cbf17903b2021-03-29T21:18:36ZengIEEEIEEE Access2169-35362018-01-016295162953110.1109/ACCESS.2018.28421148369087Improved Differential Evolution for Large-Scale Black-Box OptimizationMirjam Sepesy Maucec0https://orcid.org/0000-0003-0215-513XJanez Brest1https://orcid.org/0000-0001-5864-3533Borko Boskovic2Zdravko kacic3Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, SloveniaFaculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, SloveniaFaculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, SloveniaFaculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, SloveniaThe demand for solving large-scale complex problems continues to grow. Many real-world problems are described by a large number of variables that interact with each other in a complex way. The dimensionality of the problem has a direct impact on the computational cost of the optimization. During the last two decades, differential evolution has been shown to be one of the most powerful optimizers for a wide range of optimization problems. In this paper, we investigate its appropriateness for large-scale problems. We propose a new variation of differential evolution that exhibits good results on difficult functions with a large numbers of variables. The proposed algorithm incorporates the following mechanisms: the use of three strategies, the extended range of values for self-adapted parameters F and CR, subpopulations, and the population size reduction. The algorithm was tested on the CEC 2013 benchmark suite for largescale optimization, and on two real-world problems from the CEC 2011 benchmark suite on real-world optimization. A comparative analysis was performed with recently proposed algorithms. The analysis shows the superior performance of our algorithm on most complex problems, described by overlapping and nonseparable functions.https://ieeexplore.ieee.org/document/8369087/Large-scale global optimizationdifferential evolutioncontrol parametersmutation strategies combination
collection DOAJ
language English
format Article
sources DOAJ
author Mirjam Sepesy Maucec
Janez Brest
Borko Boskovic
Zdravko kacic
spellingShingle Mirjam Sepesy Maucec
Janez Brest
Borko Boskovic
Zdravko kacic
Improved Differential Evolution for Large-Scale Black-Box Optimization
IEEE Access
Large-scale global optimization
differential evolution
control parameters
mutation strategies combination
author_facet Mirjam Sepesy Maucec
Janez Brest
Borko Boskovic
Zdravko kacic
author_sort Mirjam Sepesy Maucec
title Improved Differential Evolution for Large-Scale Black-Box Optimization
title_short Improved Differential Evolution for Large-Scale Black-Box Optimization
title_full Improved Differential Evolution for Large-Scale Black-Box Optimization
title_fullStr Improved Differential Evolution for Large-Scale Black-Box Optimization
title_full_unstemmed Improved Differential Evolution for Large-Scale Black-Box Optimization
title_sort improved differential evolution for large-scale black-box optimization
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2018-01-01
description The demand for solving large-scale complex problems continues to grow. Many real-world problems are described by a large number of variables that interact with each other in a complex way. The dimensionality of the problem has a direct impact on the computational cost of the optimization. During the last two decades, differential evolution has been shown to be one of the most powerful optimizers for a wide range of optimization problems. In this paper, we investigate its appropriateness for large-scale problems. We propose a new variation of differential evolution that exhibits good results on difficult functions with a large numbers of variables. The proposed algorithm incorporates the following mechanisms: the use of three strategies, the extended range of values for self-adapted parameters F and CR, subpopulations, and the population size reduction. The algorithm was tested on the CEC 2013 benchmark suite for largescale optimization, and on two real-world problems from the CEC 2011 benchmark suite on real-world optimization. A comparative analysis was performed with recently proposed algorithms. The analysis shows the superior performance of our algorithm on most complex problems, described by overlapping and nonseparable functions.
topic Large-scale global optimization
differential evolution
control parameters
mutation strategies combination
url https://ieeexplore.ieee.org/document/8369087/
work_keys_str_mv AT mirjamsepesymaucec improveddifferentialevolutionforlargescaleblackboxoptimization
AT janezbrest improveddifferentialevolutionforlargescaleblackboxoptimization
AT borkoboskovic improveddifferentialevolutionforlargescaleblackboxoptimization
AT zdravkokacic improveddifferentialevolutionforlargescaleblackboxoptimization
_version_ 1724193067234230272