The paper deals with the adaptive mechanisms in differential evolution (DE) algorithm. DE is a simple and effective stochastic algorithm frequently used in solving the real-world global optimization problems. The efficiency of the algorithm is sensitive to setting its control parameters. Several adaptive approaches have appeared recently in order to avoid control-parameter tuning. A new adaptive variant of differential evolution is proposed in this study. It is based on a combination of two adaptive approaches published before. The new algorithm was tested on the well-known set of benchmark problems developed for the special session of CEC2005 at four levels of population size and its performance was compared with the adaptive variants that were applied in the design of the new algorithm. The new adaptive DE variant outperformed the others in several test problems but its efficiency on average was not better.
The social foraging behavior of Escherichia coli bacteria has recently been studied by several researchers to develop a new algorithm for distributed optimization control. The Bacterial Foraging Optimization Algorithm (BFOA), as it is called now, has many features analogous to classical Evolutionary Algorithms (EA). Passino [1] pointed out that the foraging algorithms can be integrated in the framework of evolutionary algorithms. In this way BFOA can be used to model some key survival activities of the population, which is evolving. This article proposes a hybridization of BFOA with another very popular optimization technique of current interest called Differential Evolution (DE). The computational chemotaxis of BFOA, which may also be viewed as a stochastic gradient search, has been coupled with DE type mutation and crossing over of the optimization agents. This leads to the new hybrid algorithm, which has been shown to overcome the problems of slow and premature convergence of both the classical DE and BFOA over several benchmark functions as well as real world optimization problems.
The differential evolution (DE) algorithm is a powerful population-based stochastic technique to search for global optimum in the continuous search space. Success of DE algorithm strongly depends on choosing its parameters. The competition in differential evolution was shown to be an efficient instrument to avoid time-consuming process of tuning control parameters. A new variant of competitive DE algorithm, called BEBERAN, was proposed and tested on benchmark functions at four levels of the search space dimension. The BEBERAN was compared with the most promising competitive variant, DEBR18. BEBERAN, in contrast to DEBR18, includes in addition the exponential crossover.
Accuracy alone can be deceptive when evaluating the performance of a classifier, especially if the problem involves a high number of classes. This paper proposes an approach used for dealing with multi-class problems, which tries to avoid this issue. The approach is based on the Extreme Learning Machine (ELM) classifier, which is trained by using a Differential Evolution (DE) algorithm. Two error measures (Accuracy, $C$, and Sensitivity, S) are combined and applied as a fitness function for the algorithm. The proposed approach is able to obtain multi-class classifiers with a high classification rate level in the global dataset with an acceptable level of accuracy for each class. This methodology is evaluated over seven benchmark classification problems and one real problem, obtaining promising results.
Consensus clustering algorithms are used to improve properties of traditional clustering methods, especially their accuracy and robustness. In this article, we introduce our approach that is based on a refinement of the set of initial partitions and uses differential evolution algorithm in order to find the most valid solution. Properties of the algorithm are demonstrated on four benchmark datasets.
Since their appearance in 1993, first approaching the Shannon limit, turbo codes have given a new direction in the channel encoding field, especially since they have been adopted for multiple norms of telecommunications such as deeper communication. A robust interleaver can significantly contribute to the overall performance a turbo code system. Search for a good interleaver is a complex combinatorial optimization problem. In this paper, we present genetic algorithms and differential evolution, two bio-inspired approaches that have proven the ability to solve non-trivial combinatorial optimization tasks, as promising optimization methods to find a well-performing interleaver for large frame sizes.
In this article, a technique called Meta-Optimization is used to enhance the effectiveness of bio-inspired algorithms that solve antenna array synthesis problems. This technique consists on a second optimization layer that finds the best behavioral parameters for a given algorithm, which allows to achieve better results. Bio-inspired computational methods are useful to solve complex multidimensional problems such as the design of antenna arrays. However, their performance depends heavily on the initial parameters. In this paper, the distances between antenna array elements are calculated in order to reduce electromagnetic interference from undesired sources. The results are compared to previous works, showing an improvement on the performance of bio-inspired optimization algorithms such as Particle Swarm Optimization and Differential Evolution. These results are found to be statistically significant based on the Wilcoxon's rank sum test as compared to these methods using the standard parameters proposed in the literature. Furthermore, graphical representations of the Meta-Optimization process called meta-landscapes are presented, showing the behavior of these algorithms for a range of different parameters, providing the best parameter combinations for each antenna problem.
Air transportation between Europe and the U.S. is becoming more and more significant. It can only hardly be replaced by other means of transportation, since its biggest advantages include speed and reliability. Air transportation forecasting is important for planning the development of airports and related infrastructure, and of course also for air carriers. Therefore, it is important to forecast the number of flights between selected airports in Europe and the U.S. and the number of transported persons. A gravity model is usually used for this forecasting. Determination of coefficients which significantly affect results of the formulas used in the gravity model is crucial. Coefficients are, as a rule, computed by an iterative algorithm implementing the gradient method. This technique has some limitations if the state space is inappropriate. Moreover, the exponent parameter in the formula is obviously fixed. We have chosen the new method of differential evolution to determine the gravity model coefficient. Differential evolution works with populations similarly to other evolution algorithms. It is suitable for solving complex numerical problems. The suggested methodology can be helpful for various airlines to forecast demand and plan new long-haul routes.
Diabetes mellitus (DM) is a disease affecting millions of people worldwide, and its medical care brings an economic wear to patients and public health systems. Many efforts have been made to deal with DM, one of them is the full-automation of insulin delivery. This idea consists in design a closed-loop control system to maintain blood glucose levels (BGL) within normal ranges. Dynamic models of glucose-insulin-carbohydrates play an important role in synthesis of control algorithms, but also in other aspects of DM care, such as testing glucose sensors, or as support systems for health care decisions. Therefore, there are several mathematical models reproducing glycemic dynamics of DM, most of them validated with nominal parameters of standardized patients. Nevertheless, individual patient-oriented models could open the possibility of having closed-loop personalized therapies. This problem can be addressed through the information provided by open-loop therapy based on continuous glucose monitoring and subcutaneous insulin infusion. This paper considers the problem of identifying particular parameters of a compartmental model of glucose-insulin dynamics in DM; the goal is fitting the model response to historical data of a diabetic patient collected during a time period of her/his daily life. At this time, Sorensen model is one of the most complete compartmental models representing the complex dynamics of the glucose-insulin metabolism. This is a system of 19 ordinary differential equations (ODEs), thus the identification of its parameters is a non-easy task. In this contribution, parameter identification was performed via three evolutionary algorithms: differential evolution, ant colony optimization and particle swarm optimization. The obtained results show that evolutionary algorithms are powerful tools to solve problems of parametric identification. Also, a comparative analysis of the three algorithms was realized throw a wilcoxon sign-rank test, in which colony optimization had the better performance. The model obtained with the estimated parameters could be used to in type 1 diabetes mellitus (T1DM) care, such as in the design of full-automation of insulin infusion.
Precise wind energy potential assessment is vital for wind energy generation and planning and development of new wind power plants. This work proposes and evaluates a novel two-stage method for location-specific wind energy potential assessment. It combines accurate statistical modelling of annual wind direction distribution in a given location with supervised machine learning of efficient estimators that can approximate energy efficiency coefficients from the parameters of optimized statistical wind direction models. The statistical models are optimized using differential evolution and energy efficiency is approximated by evolutionary fuzzy rules.