Borko Boskovic

Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems

We describe an efficient technique for adapting control parameter settings associated with differential evolution (DE). The DE algorithm has been used in many practical cases and has demonstrated good convergence properties. It has only a few control parameters, which are kept fixed throughout the entire evolutionary process. However, it is not an easy task to properly set control parameters in DE. We present an algorithm-a new version of the DE algorithm-for obtaining self-adaptive control parameter settings that show good performance on numerical benchmark problems. The results show that our algorithm with self-adaptive control parameter settings is better than, or at least comparable to, the standard DE algorithm and evolutionary algorithms from literature when considering the quality of the solutions obtained

Performance comparison of self-adaptive and adaptive differential evolution algorithms

Differential evolution (DE) has been shown to be a simple, yet powerful, evolutionary algorithm for global optimization for many real problems. Adaptation, especially self-adaptation, has been found to be highly beneficial for adjusting control parameters, especially when done without any user interaction. This paper presents differential evolution algorithms, which use different adaptive or self-adaptive mechanisms applied to the control parameters. Detailed performance comparisons of these algorithms on the benchmark functions are outlined.

High-dimensional real-parameter optimization using Self-Adaptive Differential Evolution algorithm with population size reduction

In this paper we investigate a self-adaptive differential evolution algorithm (jDEdynNP-F) where F and CR control parameters are self-adapted and a population size reduction method is used. Additionally the proposed jDEdynNP-F algorithm uses a mechanism for sign changing of F control parameter with some probability based on the fitness values of randomly chosen vectors, which are multiplied by the F control parameter (scaling factor) in the mutation operation of DE algorithm. The performance of the jDEdynNP-F algorithm is evaluated on the set of 7 benchmark functions provided for the CECpsila2008 special session on high-dimensional real-parameter optimization.

Dynamic optimization using Self-Adaptive Differential Evolution

In this paper we investigate a Self-Adaptive Differential Evolution algorithm (jDE) where F and CR control parameters are self-adapted and a multi-population method with aging mechanism is used. The performance of the jDE algorithm is evaluated on the set of benchmark functions provided for the CEC 2009 special session on evolutionary computation in dynamic and uncertain environments.

Large Scale Global Optimization using Differential Evolution with self-adaptation and cooperative co-evolution

In this paper, an optimization algorithm is formulated and its performance assessment for large scale global optimization is presented. The proposed algorithm is named DEwSAcc and is based on Differential Evolution (DE) algorithm, which is a floating-point encoding evolutionary algorithm for global optimization over continuous spaces. The original DE is extended by log-normal self-adaptation of its control parameters and combined with cooperative co-evolution as a dimension decomposition mechanism. Experimental results are given for seven high-dimensional test functions proposed for the Special Session on Large Scale Global Optimization at 2008 IEEE World Congress on Computational Intelligence.

Differential evolution for multiobjective optimization with self adaptation

This paper presents performance assessment of differential evolution for multiobjective optimization with self adaptation algorithm, which uses the self adaptation mechanism from evolution strategies to adapt F and CR parameters of the candidate creation in DE. Results for several runs on CEC2007 special session test functions are presented and assessed with different performance metrics. Based on these metrics, algorithm strengths and weaknesses are discussed.

Differential Evolution with Self-adaptation and Local Search for Constrained Multiobjective Optimization

This paper presents Differential Evolution with Self-adaptation and Local Search for Constrained Multiobjective Optimization algorithm (DECMOSA-SQP), which uses the self-adaptation mechanism from DEMOwSA algorithm presented at CEC 2007 and a SQP local search. The constrained handling mechanism is also incorporated in the new algorithm. Assessment of the algorithm using CEC 2009 special session and competition on constrained multiobjective optimization test functions is presented. The functions are composed of unconstrained and constrained problems. Their results are assessed using the IGD metric. Based on this metric, algorithm strengths and weaknesses are discussed.

Differential evolution and differential ant-stigmergy on dynamic optimisation problems

Many real-world optimisation problems are of dynamic nature, requiring an optimisation algorithm which is able to continuously track a changing optimum over time. To achieve this, we propose two population-based algorithms for solving dynamic optimisation problems (DOPs) with continuous variables: the self-adaptive differential evolution algorithm (jDE) and the differential ant-stigmergy algorithm (DASA). The performances of the jDE and the DASA are evaluated on the set of well-known benchmark problems provided for the special session on Evolutionary Computation in Dynamic and Uncertain Environments. We analyse the results for five algorithms presented by using the non-parametric statistical test procedure. The two proposed algorithms show a consistently superior performance over other recently proposed methods. The results show that both algorithms are appropriate candidates for DOPs.

Differential evolution for parameterized procedural woody plant models reconstruction

Abstract: This paper presents an approach for reconstruction of procedural three-dimensional models of woody plants (trees). The used procedural tree model operates by recursively computing all building parts of a three-dimensional tree structure by applying a fixed procedure on a given large set of numerically coded input parameters. The parameterized procedural model can later be used for computer animation. Reconstruction of a parameterized procedural model from images is done by differential evolution algorithm which evolves this model by fitting a set of its rendered images to a set of given reference images. The comparison is done on pixel level of the images through the integration of distances to the nearest similar pixels. The obtained results show that the presented approach is viable for modeling of woody plants for computer animation by evolution of the numerically coded procedural model.

An improved self-adaptive differential evolution algorithm in single objective constrained real-parameter optimization

In this paper we describe an improved version of self-adaptive differential evolution algorithm. Our algorithm uses more strategies, ageing mechanism to reinitialize an individual which stagnates in local optima, an ∊ level controlling of constraint violation. The performance of the proposed algorithm is evaluated on the set of 18 scalable benchmark functions provided for the CEC 2010 competition and special session on single objective constrained real-parameter optimization, when the dimension of decision variables is set to 10 and 30, respectively. The obtained results show that our algorithm is suitable for solving constrained optimization problems.