Search

Since the past few years, several metaheuristic algorithms, inspired by the natural processes, have been introduced to solve different complex optimization problems. Studying and comparing the convergence, computational burden and statistical significance of those metaheuristics are helpful for future algorithmic development and their applications. This paper focuses on comparing the optimization performance of classical dragonfly algorithm (DA) and its seven different variants, i.e., hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder–Mead algorithm and dragonfly algorithm (INMDA) and hybridization of dragonfly algorithm and artificial bee colony (HDA) while solving 80 CEC-2021 benchmark problems. It is observed that the convergence rates of different variants of DA algorithm vary, and the corresponding computational times for such variations are also evaluated. This paper finally ranks DA and its variants according to their convergence efficiency and Friedman test. The DADE, QGDA, BMDA and DA evolve out as the most efficient algorithms for solving the considered CEC-2021 benchmark problems. [ABSTRACT FROM AUTHOR]

The Bacterial Foraging Algorithm (BFOA) is a well-known swarm collective intelligence algorithm used to solve a variety of constraint optimization problems with wide success. Despite its universality, implementing the BFOA may be complex due to the calibration of multiple parameters. Moreover, the Two-Swim Modified Bacterial Foraging Optimization Algorithm (TS-MBFOA) is a state-of-the-art modification of the BFOA which may lead to solutions close to the optimal but with more parameters than the original BFOA. That is why in this paper we present the design using the Unified Modeling Language (UML) and the implementation in the MATLAB platform of a front-end for the TS-MBFOA algorithm to calibrate the algorithm parameters faster and with no need for editing lines of code. To test our proposal, we solve a numerical optimization problem with constraints known as tension/compression spring, where 30 independent executions were conducted using the TS-MBFOA and then compared with an earlier version called MBFOA. The runtime configuration and the parameter tuning were fluent using our front-end, and the TS-MBFOA obtained the better results. To date, there is no other user-friendly implementation of this specific algorithm in an open-source code, and the front-end is flexible enough to include other numerical optimization problems with minimal effort. [ABSTRACT FROM AUTHOR]

At present, artificial bee colony algorithm (ABC) is one of the hot issues in swarm intelligence algorithm. Since it was proposed, people have done a lot of improvement work for ABC algorithm. To address the shortcomings of ABC, an improved ABC guided by experience (named as EABC) is proposed in this paper. In EABC, it collects the experience of individual improvement caused by dimension change in the iterative process, and selects the dimensions to change according to a ratio when a new position needs to be generated. In this way, the individual can choose a good direction to improve its quality. Numerical experiments show that EABC has a better performance. [ABSTRACT FROM AUTHOR]

Metaheuristics play a critical role in solving optimization problems, and most of them have been inspired by the collective intelligence of natural organisms in nature. This paper proposes a new metaheuristic algorithm inspired by gorilla troops' social intelligence in nature, called Artificial Gorilla Troops Optimizer (GTO). In this algorithm, gorillas' collective life is mathematically formulated, and new mechanisms are designed to perform exploration and exploitation. To evaluate the GTO, we apply it to 52 standard benchmark functions and seven engineering problems. Friedman's test and Wilcoxon rank‐sum statistical tests statistically compared the proposed method with several existing metaheuristics. The results demonstrate that the GTO performs better than comparative algorithms on most benchmark functions, particularly on high‐dimensional problems. The results demonstrate that the GTO can provide superior results compared with other metaheuristics. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The paper introduces a new approach to enhance optimization algorithms when solving the piecewise linearization problem of a given function. Eight swarm intelligence algorithms were selected to be experimentally compared. The problem is represented by the calculation of the distance between the original function and the estimation from the piecewise linear function. Here, the piecewise linearization of 2D functions is studied. Each of the employed swarm intelligence algorithms is enhanced by a newly proposed automatic detection of the number of piecewise linear parts that determine the discretization points to calculate the distance between the original and piecewise linear function. The original algorithms and their enhanced variants are compared on several examples of piecewise linearization problems. The results show that the enhanced approach performs sufficiently better when it creates a very promising approximation of functions. Moreover, the degree of precision is slightly decreased by the focus on the speed of the optimization process. [ABSTRACT FROM AUTHOR]

Optimization is an important and fundamental challenge to solve optimization problems in different scientific disciplines. In this paper, a new stochastic nature-inspired optimization algorithm called Pelican Optimization Algorithm (POA) is introduced. The main idea in designing the proposed POA is simulation of the natural behavior of pelicans during hunting. In POA, search agents are pelicans that search for food sources. The mathematical model of the POA is presented for use in solving optimization issues. The performance of POA is evaluated on twenty-three objective functions of different unimodal and multimodal types. The optimization results of unimodal functions show the high exploitation ability of POA to approach the optimal solution while the optimization results of multimodal functions indicate the high ability of POA exploration to find the main optimal area of the search space. Moreover, four engineering design issues are employed for estimating the efficacy of the POA in optimizing real-world applications. The findings of POA are compared with eight well-known metaheuristic algorithms to assess its competence in optimization. The simulation results and their analysis show that POA has a better and more competitive performance via striking a proportional balance between exploration and exploitation compared to eight competitor algorithms in providing optimal solutions for optimization problems. [ABSTRACT FROM AUTHOR]

This paper presents a novel version of the bees algorithm. This version is characterized by an extended set of search operators, and a mechanism that protects the most recently generated solutions from competition with more evolved individuals. Compared to the standard implementation of the bees algorithm, the new procedure requires the selection of an additional set of parameters. A new statistical method is proposed to tune these extra parameters. The proposed tuning method was used to determine a unique set of learning parameters for the modified bees algorithm on eight popular function optimization benchmarks. When tested against the standard bees algorithm and two other well-known optimization procedures, the new algorithm attained top performances on nearly all the benchmarks. The experimental results also proved that, tested on a search space much larger than that where it was tuned, the modified bees algorithm still outperformed the standard method, and the degradation of the performance of the two algorithms was comparable. These results prove the effectiveness of the modified bees algorithm, and show that the proposed tuning procedure is a valuable alternative to the complex and subjective trial-and-error methods that are often used. [ABSTRACT FROM PUBLISHER]

Data mining is one of the most explored and ongoing areas of research. Sentiment analysis is a popular application of data mining, where the information regarding the customer's emotions or attitude is extracted by applying various methods or techniques. The earlier work in sentiment analysis deals with supervised, unsupervised machine learning-based approaches and lexicon-based approaches. Nature-inspired algorithms are recently becoming an emerging topic of research for developing new algorithms and for optimizing the results as nature serves as an excellent source of inspiration. These techniques are divided into bio-inspired algorithms, physics–chemistry based algorithms, and others. This survey mainly deals with bio-inspired algorithms, which consist of swarm intelligence based and non-swarm intelligence-based algorithms. We present a comprehensive review of the significant bio-inspired algorithms that are popularly applied in sentiment analysis. We discuss state-of-the-art on these significant algorithms along with a comparative study on these algorithms by reviewing eighty articles from various journals, conferences, book chapters, etc. Finally, this review draws some essential conclusions and identifies some research gaps to motivate researchers in this area. [ABSTRACT FROM AUTHOR]

This work proposes a new swarm intelligent nature-inspired algorithm called naked mole-rat (NMR) algorithm. This NMR algorithm mimics the mating patterns of NMRs present in nature. Two types of NMRs called workers and breeders are found to depict these patterns. Workers work continuously in the endeavor to become breeders, while breeders compete among themselves to mate with the queen. Those breeders who become sterile are pushed back to the worker's group, and the fittest worker becomes a new breeder. This phenomenon has been adapted to develop the NMR algorithm. The algorithm has been benchmarked on 27 well-known test functions, and its performance is evaluated by a comparative study with particle swarm optimization (PSO), grey wolf optimization (GWO), whale optimization algorithm (WOA), differential evolution (DE), gravitational search algorithm (GSA), fast evolutionary programming (FEP), bat algorithm (BA), flower pollination algorithm (FPA), and firefly algorithm (FA). The experimental results and statistical analysis prove that NMR algorithm is very competitive as compared to other state-of-the-art algorithms. The matlab code for NMR algorithm is avaliable at https://github.com/rohitsalgotra/Naked-Mole-Rat-Algorithm. [ABSTRACT FROM AUTHOR]