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

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86092956" target="_blank" >RIV/61989100:27240/11:86092956 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/NaBIC.2011.6089460" target="_blank" >http://dx.doi.org/10.1109/NaBIC.2011.6089460</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/NaBIC.2011.6089460" target="_blank" >10.1109/NaBIC.2011.6089460</a>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

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

Popis výsledku anglicky

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

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 2011 Third World Congress on Nature and Biologically Inspired Computing

ISBN

978-1-4577-1122-0

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

207-212

Název nakladatele

IEEE

Místo vydání

New York

Místo konání akce

Salamanca

Datum konání akce

19. 10. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—