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

Solving the Space -Time Fractional RLW and MRLW Equations Using Modified Extended Tanh Method with the Riccati Equation

In the present paper, a traveling wave solution has been established using the modified extended tanh method for space-time fractional nonlinear partial differential equations. We used this method to find exact solutions...

Research on the Dual Problem of Trust Region Bundle Method

With the rapid development of science and technology as well as the cross-integration between the various disciplines, the nonsmooth optimization problem plays an increasingly important role in operational research. In t...

Modelling Grammaticality-grading in Natural Language Systems Using a Vector Space Approach

There exist several natural language processing systems that focus on checking the grammaticality (grammatical correctness or incorrectness) of natural language texts. Studies however showed that most existing systems do...

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...

Evaluation of Calinski-Harabasz Criterion as Fitness Measure for Genetic Algorithm Based Segmentation of Cervical Cell Nuclei

In this paper, the classi cation capability of Calinski-Harabasz criterion as an internal cluster validation measure has been evaluated for clustering-based region discrimination on cervical cells. In this approach, subr...

Download PDF file
  • EP ID EP322420
  • DOI 10.9734/JAMCS/2017/38065
  • Views 84
  • Downloads 0

How To Cite

George Anescu (2017). 1P-ABC, a Simpli ed ABC Variant for Continuous Optimization Problems. Journal of Advances in Mathematics and Computer Science, 25(5), 1-16. https://europub.co.uk/articles/-A-322420