68 research outputs found
Analyzing the Scalability Performance of Crossover-First and Self-Adaptive Differential Evolution Algorithms for Complex Numerical Optimization
Two Crossover-first Differential Evolution (XDE) algorithms as well as four self-adaptive DE algorithms are compared in this study in terms of their optimization accuracy for solving a set of 15 complex, non-linear numerical optimization functions across 4 different dimensions of 10, 30, 50 and 100 optimization variables. XDE is a crossover-first variant of the original DE algorithm where XjDE is the crossover-first variant of the self-adaptive jDE algorithm. The original DE representing a fixed parameter strategy is tested against four self-adaptive algorithms, namely the DESACR, DESACRF, SDE and jDE algorithms. Although XDE is able to outperform XjDE in all 15 test problems for the lowest dimensional benchmark test setting of 10 variables, the crossover-first approach in XjDE is able to improve its performance and obtained better results over XDE in some of the test problems for the higher-dimensional benchmark test settings of 30, 50 and 100 variables. As such, this shows that there is some merit in adopting the crossover-first approach into the self-adaptive XjDE algorithm since the CR and F parameters are automatically adjusted and optimized by the algorithm itself as compared to the fixed CR and F in XDE which has to be manually tuned by hand. The results also show that different self-adaptive parameter tuning schemes have significantly different effects on the performance of DE as the number of optimization dimensions increases
A Self-adaptive Fireworks Algorithm for Classification Problems
his work was supported in part by the National Natural Science Foundation of China under Grants 61403206 and 61771258, in part by the Natural Science Foundation of Jiangsu Province under Grants BK20141005 and BK20160910, in part by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China under Grant 14KJB520025, in part by the Priority Academic Program Development of Jiangsu Higher Education Institutions, in part by the Open Research Fund of Jiangsu Engineering Research Center of Communication and Network Technology, NJUPT, under Grant JSGCZX17001, and in part by the Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing, Xi’an University of Technology, under Contract SKL2017CP01.Peer reviewedPublisher PD
Multi-population inflationary differential evolution algorithm with adaptive local restart
In this paper a Multi-Population Inflationary Differential Evolution algorithm with Adaptive Local Restart is presented and extensively tested over more than fifty test functions from the CEC 2005, CEC 2011 and CEC 2014 competitions. The algorithm combines a multi-population adaptive Differential Evolution with local search and local and global restart procedures. The proposed algorithm implements a simple but effective mechanism to avoid multiple detections of the same local minima. The novel mechanism allows the algorithm to decide whether to start or not a local search. The local restart of the population, which follows the local search, is, therefore, automatically adapted
Fireworks explosion boosted Harris Hawks optimization for numerical optimization: Case of classifying the severity of COVID-19
Harris Hawks optimization (HHO) is a swarm optimization approach capable of handling a broad range of optimization problems. HHO, on the other hand, is commonly plagued by inadequate exploitation and a sluggish rate of convergence for certain numerical optimization. This study combines the fireworks algorithm's explosion search mechanism into HHO and proposes a framework for fireworks explosion-based HHo to address this issue (FWHHO). More specifically, the proposed FWHHO structure is comprised of two search phases: harris hawk search and fireworks explosion search. A search for fireworks explosion is done to identify locations where superior hawk solutions may be developed. On the CEC2014 benchmark functions, the FWHHO approach outperforms the most advanced algorithms currently available. Moreover, the new FWHHO framework is compared to four existing HHO and fireworks algorithms, and the experimental results suggest that FWHHO significantly outperforms existing HHO and fireworks algorithms. Finally, the proposed FWHHO is employed to evolve a kernel extreme learning machine for diagnosing COVID-19 utilizing biochemical indices. The statistical results suggest that the proposed FWHHO can discriminate and classify the severity of COVID-19, implying that it may be a computer-aided approach capable of providing adequate early warning for COVID-19 therapy and diagnosis
CHEMOTAXIS DIFFERENTIAL EVOLUTION OPTIMIZATION TECHNIQUES FOR GLOBAL OPTIMIZATION
Nature inspired and bio-inspired algorithms have been recently used for solving low
and high dimensional search and optimization problems. In this context, Bacterial
Foraging Optimization Algorithm (BFOA) and Differential Evolution (DE) have been
widely employed as global optimization techniques inspired from social foraging behavior
of Escheria coli bacteria and evolutionary ideas such as mutation, crossover, and selection,
respectively.
BFOA employs chemotaxis (tumble and run steps of a bacterium in its lifetime)
activity for local search whereas the global search is performed by elimination-dispersal
operator. Elimination-dispersal operator kills or disperses some bacteria and replaces
others randomly in the search space. This operator mimics bacterium’s death or dispersal
in case of high temperature or sudden water flow in the environment. DE employs the mutation and crossover operators to make a local and a global search
that explore the search space. Exploration and exploitation balance of DE is performed
by two different parameters: mutation scaling factor and crossover rate. These two
parameters along with the number of population have an enormous impact on optimization
performance.
In this thesis, two novel hybrid techniques called Chemotaxis Differential Evolution
Optimization Algorithm (CDEOA) for low dimensions and micro CDEOA (μCDEOA)
for high dimensional problems are proposed. In these techniques, we incorporate the
principles of DE into BFOA with two conditions. What makes our techniques different
from its counterparts is that it is based on two optimization strategies: exploration of a
bacterium in case of its failure to explore its vicinity for food source and exploitation of
a bacterium in case of its achievement to exploit more food source. By means of these
evolutionary ideas, we manage to establish an efficient balance between exploration of
new areas in the search space and exploitation of search space gradients. Statistics of
the computer simulations indicate that μCDEOA outperforms, or is comparable to, its
competitors in terms of its convergence rates and quality of final solution for complex high
dimensional problems
Recommended from our members
A survey of swarm intelligence for dynamic optimization: algorithms and applications
Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have been proven to be good methods to address difficult optimization problems under stationary environments. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution. In the last two decades, there has been a growing interest of addressing DOPs using SI algorithms due to their adaptation capabilities. This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications. In addition, this paper focuses on the enhancement strategies integrated in SI algorithms to address dynamic changes, the performance measurements and benchmark generators used in SIDO. Finally, some considerations about future directions in the subject are given
- …