A hybrid swarm-based algorithm for single-objective optimization problems involving high-cost analyses

In many technical fields, single-objective optimization procedures in continuous domains involve expensive numerical simulations. In this context, an improvement of the Artificial Bee Colony (ABC) algorithm, called the Artificial super-Bee enhanced Colony (AsBeC), is presented. AsBeC is designed to provide fast convergence speed, high solution accuracy and robust performance over a wide range of problems. It implements enhancements of the ABC structure and hybridizations with interpolation strategies. The latter are inspired by the quadratic trust region approach for local investigation and by an efficient global optimizer for separable problems. Each modification and their combined effects are studied with appropriate metrics on a numerical benchmark, which is also used for comparing AsBeC with some effective ABC variants and other derivative-free algorithms. In addition, the presented algorithm is validated on two recent benchmarks adopted for competitions in international conferences. Results show remarkable competitiveness and robustness for AsBeC.Comment: 19 pages, 4 figures, Springer Swarm Intelligenc

Gender-Based Deep Learning Firefly Optimization Method for Test Data Generation.

Software testing is a widespread validation means of software quality assurance in industry. Intelligent optimization algorithms have been proved to be an effective way of automatic test data generation. Firefly algorithm has received extensive attention and been widely used to solve optimization problems because of less parameters and simple implement. To overcome slow convergence rate and low accuracy of the firefly algorithm, a novel firefly algorithm with deep learning is proposed to generate structural test data. Initially, the population is divided into male subgroup and female subgroup. Following the randomly attracted model, each male firefly will be attracted by another randomly selected female firefly to focus on global search in whole space. Each female firefly implements local search under the leadership of the general center firefly, constructed based on historical experience with deep learning. At the final period of searching, chaos search is conducted near the best firefly to improve search accuracy. Simulation results show that the proposed algorithm can achieve better performance in terms of success coverage rate, coverage time, and diversity of solutions

Hybrid Sine Cosine Algorithm for Solving Engineering Optimization Problems

Engineering design optimization problems are difficult to solve because the objective function is often complex, with a mix of continuous and discrete design variables and various design constraints. Our research presents a novel hybrid algorithm that integrates the benefits of the sine cosine algorithm (SCA) and artificial bee colony (ABC) to address engineering design optimization problems. The SCA is a recently developed metaheuristic algorithm with many advantages, such as good search ability and reasonable execution time, but it may suffer from premature convergence. The enhanced SCA search equation is proposed to avoid this drawback and reach a preferable balance between exploitation and exploration abilities. In the proposed hybrid method, named HSCA, the SCA with improved search strategy and the ABC algorithm with two distinct search equations are run alternately during working on the same population. The ABC with multiple search equations can provide proper diversity in the population so that both algorithms complement each other to create beneficial cooperation from their merger. Certain feasibility rules are incorporated in the HSCA to steer the search towards feasible areas of the search space. The HSCA is applied to fifteen demanding engineering design problems to investigate its performance. The presented experimental results indicate that the developed method performs better than the basic SCA and ABC. The HSCA accomplishes pretty competitive results compared to other recent state-of-the-art methods

The Design of a Uniplanar Printed Triple Band-Rejected UWB Antenna using Particle Swarm Optimization and the Firefly Algorithm

YesA compact planar monopole antenna is proposed for ultra-wideband applications. The antenna has a microstrip line feed and band-rejected characteristics and consists of a ring patch and partial ground plane with a defective ground structure of rectangular shape. An annular strip is etched above the radiating element and two slots, one C-shaped and one arc-shaped, are embedded in the radiating patch. The proposed antenna has been optimized using bio-inspired algorithms, namely Particle Swarm Optimization and the Firefly Algorithm, based on a new software algorithm (Antenna Optimizer). Multi-objective optimization achieves rejection bands at 3.3 to 3.7 GHz for WiMAX, 5.15 to 5.825 GHz for the 802.11a WLAN system or HIPERLAN/2, and 7.25 to 7.745 GHz for C-band satellite communication systems. Validated results show wideband performance from 2.7 to 10.6 GHz with S11 ˂ -10 dB. The antenna has compact dimensions of 28 × 30 mm2. The radiation pattern is comparatively stable across the operating band with a relatively stable gain except in the notched bands.This work was supported in part by the United Kingdom Engineering and Physical Science Research Council (EPSRC) under Grant EP/E022936A, TSB UK under grant application KTP008734 and the Iraqi Ministry of Higher Education and Scientific Research

A Comprehensive Review of Recent Variants and Modifications of Firefly Algorithm

Swarm intelligence (SI) is an emerging field of biologically-inspired artificial intelligence based on the behavioral models of social insects such as ants, bees, wasps, termites etc. Swarm intelligence is the discipline that deals with natural and artificial systems composed of many individuals that coordinate using decentralized control and self-organization. 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. In the last two decades, there has been a growing interest of addressing Dynamic Optimization Problems using SI algorithms due to their adaptation capabilities. This paper presents a broad review on two SI algorithms: 1) Firefly Algorithm (FA) 2) Flower Pollination Algorithm (FPA). FA is inspired from bioluminescence characteristic of fireflies. FPA is inspired from the the pollination behavior of flowering plants. This article aims to give a detailed analysis of different variants of FA and FPA developed by parameter adaptations, modification, hybridization as on date. This paper also addresses the applications of these algorithms in various fields. In addition, literatures found that most of the cases that used FA and FPA technique have outperformed compare to other metaheuristic algorithms

A Review and Comparative Study of Firefly Algorithm and its Modified Versions

Firefly algorithm is one of the well-known swarm-based algorithms which gained popularity within a short time and has different applications. It is easy to understand and implement. The existing studies show that it is prone to premature convergence and suggest the relaxation of having constant parameters. To boost the performance of the algorithm, different modifications are done by several researchers. In this chapter, we will review these modifications done on the standard firefly algorithm based on parameter modification, modified search strategy and change the solution space to make the search easy using different probability distributions. The modifications are done for continuous as well as non-continuous problems. Different studies including hybridization of firefly algorithm with other algorithms, extended firefly algorithm for multiobjective as well as multilevel optimization problems, for dynamic problems, constraint handling and convergence study will also be briefly reviewed. A simulation-based comparison will also be provided to analyse the performance of the standard as well as the modified versions of the algorithm