By Topic

Dichotomous search in ABC and its application in parameter estimation of software reliability growth models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sharma, T.K. ; Dept. of Paper Technol., Indian Inst. of Technol., Roorkee, India ; Pant, M. ; Abraham, A.

ABC (Artificial Bee Colony) is one of the most recent nature inspired algorithm (NIA) based on swarming metaphor. Proposed by Karaboga in 2005, ABC has proven to be a robust and efficient algorithm for solving global optimization problems over continuous space. In this paper, we propose a modified version of the ABC to improve its performance, in terms of converging to individual optimal point and to compensate the limited amount of search moves of original ABC. In modified version called Dichotomous ABC (DABC), the idea is to move dichotomously in both directions to generate a new trial point. The performance of the proposed algorithm is analyzed on five standard benchmark problems and also we explored the applicability of the proposed algorithm to estimate the parameters of software reliability growth models (SRGM). The proposed algorithm presents significant advantages in handling variety of modeling problems such as the exponential model, power model and Delayed S Shaped model.

Published in:

Nature and Biologically Inspired Computing (NaBIC), 2011 Third World Congress on

Date of Conference:

19-21 Oct. 2011