SQG-Differential Evolution for difficult optimization problems under a tight function evaluation budget

10/18/2017
by   Ramses Sala, et al.
0

In the context of industrial engineering it is important to integrate efficient computational optimization methods in the product development process. Some of the most challenging simulation based engineering design optimization problems are characterized by: a large number of design variables, the absence of analytical gradient information, highly non-linear objectives and a limited function evaluation budget. Although a huge variety of different optimization algorithms is available, the development and selection of efficient algorithms for problems with these industrial relevant characteristics, remains a challenge. In this communication a hybrid variant of Differential Evolution (DE) is introduced which combines aspects of Stochastic Quasi-Gradient (SQG) methods within the framework of DE, in order to improve optimization efficiency on problems with the previously mentioned characteristics. The performance of the resulting method is compared with other state-of-the-art DE variants on 25 commonly used test functions, under tight function evaluation budget constraints of 1000 evaluations. The experimental results indicate that the proposed method performs particularly good on the "difficult" (high dimensional, multi-modal, inseparable) test functions. The operations used in the proposed mutation scheme, are computationally inexpensive, and can be easily implemented in existing differential evolution or other optimization algorithms by a few lines of program code as an non-invasive optional setting. Besides the applicability of the presented algorithm by itself, the described concepts can serve as a useful and interesting addition to the algorithmic operators in the frameworks of heuristics and evolutionary optimization and computing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2014

Evaluation The Efficiency Of Cuckoo Optimization Algorithm

In this paper a new evolutionary algorithm, for continuous nonlinear opt...
research
06/07/2018

Multiobjective Test Problems with Degenerate Pareto Fronts

In multiobjective optimization, a set of scalable test problems with a v...
research
07/13/2018

Global optimization test problems based on random field composition

The development and identification of effective optimization algorithms ...
research
03/02/2023

Comparison of High-Dimensional Bayesian Optimization Algorithms on BBOB

Bayesian Optimization (BO) is a class of black-box, surrogate-based heur...
research
10/24/2022

Applying Autonomous Hybrid Agent-based Computing to Difficult Optimization Problems

Evolutionary multi-agent systems (EMASs) are very good at dealing with d...
research
08/09/2019

A Fast and Efficient Stochastic Opposition-Based Learning for Differential Evolution in Numerical Optimization

A new variant of stochastic opposition-based learning (OBL) is proposed ...
research
05/02/2021

Paradiseo: From a Modular Framework for Evolutionary Computation to the Automated Design of Metaheuristics —22 Years of Paradiseo—

The success of metaheuristic optimization methods has led to the develop...

Please sign up or login with your details

Forgot password? Click here to reset