1P-ABC, a Simpli ed ABC Variant for Continuous Optimization Problems
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 25, Issue 5
Abstract
In this paper a novel simpli ed and fast variant of the ABC algorithm is proposed, 1 Population ABC (1P-ABC), with the aim to increase the eciency of the ABC algorithm by using only one population of bees, the employed bees, while maintaining a good e ectiveness of the algorithm in solving dicult nonlinear optimization problems. The novel 1P-ABC algorithm was tested, both regarding the eciency and the success rate, against three known variants of ABC, the original ABC algorithm, an improved variant, Gbest-guided Arti cial Bee Colony (GABC), and another improved variant, Fast ABC (F-ABC). The testing was conducted by employing an original testing methodology over a set of 11 scalable, multimodal, continuous optimization functions (10 unconstrained and 1 constrained) most of them with known global solutions. The novel proposed 1P-ABC algorithm outperformed the other ABC variants in eciency, while for the success rate the results were mixed.
Authors and Affiliations
George Anescu
Keywords
Related Articles
- EP ID EP322420
- DOI 10.9734/JAMCS/2017/38065
- Views 88
- Downloads 0
Finite Time Blow-up, Extinction and Non-extinction of Solutions for an Evolutionary Problem
In this paper we consider a class of p-biharmonic parabolic equation with nonlocal nonlinearities and Neumann boundary condition. By constructing suitable auxiliary functions and using differential inequalities, we give...
Rigidity and Shrinkability of Diagonalizable Matrices
We introduce the seemingly new concept of a rigid matrix based on the comparison of its sparsity to the sparsity of the natural powers of the matrix. Our results could be useful as a usage guide in the scheduling of vari...
On Properties Related To *–Reversible Rings
In this paper, a class of *-rings which is a generalization of *–reversible rings is introduced. A ring with involution * is called central *–reversible if for a ,b∈R, whenever ab=0 ,b^* a is central in R. Since every *–...
Convergence of Differential Transform Method for Ordinary Differential Equations
Differential transform method (DTM) as a method for approximating solutions to differential equations have many theorems that are often used without recourse to their proofs. In this paper, attempts are made to compile t...
Design and Comparison of Equiripple Bandpass Filter for Wireless Applications at Varying Bandwidths
This paper presents the design of equiripple programmable bandpass filter for wireless applications. The designed filter covers a wide range of bandwidth compared to what can be achieved by a simple microcontroller. This...