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 62
- Downloads 0
Fuzzy Tangle Graph
We will study anew graph, this graph called fuzzy tangle graph, we will study the matrices which represent this graph, and we will discuss the relation between fuzzy tangle graph and dual fuzzy tangle graph. In fuzzy tan...
DT- optimality Criteria for Second Order Rotatable Designs Constructed Using Balanced Incomplete Block Design
Experimenters have come to a realization that a design can perform very well in terms of a particular statistical characteristic and still perform poorly in terms of a rival characteristic. Due to this studies have narro...
Solving Multi-level Multi-objective Fractional Programming Problem with Rough Intervals in the Objective Functions
In this paper multi-level multi-objective fractional programming problem (ML-MOFP) is considered where some or all of its coefficients in the objective function are rough intervals. At the first phase of the solution app...
Analytic Approximation Solutions of Lyapunov Orbits around the Collinear Equilibrium Points for Binary -Centuari System: The Planar Case
A third order analytic approximation solution of Lyapunov orbits around the collinear equilibrium in the planar restricted three-body problem by utilizing the Lindstedt Poincaré method is presented. The primaries are obl...
Text Summarization versus CHI for Feature Selection
Text Classification is an important technique for handling the huge and increasing amount of text documents on the web. An important problem of text classification is features selection. Many feature selection techniques...