Cauchy movements for artificial bees for finding better food sources
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86092960" target="_blank" >RIV/61989100:27240/11:86092960 - isvavai.cz</a>
Výsledek na webu
<a href="http://dx.doi.org/10.1109/NaBIC.2011.6089608" target="_blank" >http://dx.doi.org/10.1109/NaBIC.2011.6089608</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/NaBIC.2011.6089608" target="_blank" >10.1109/NaBIC.2011.6089608</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Cauchy movements for artificial bees for finding better food sources
Popis výsledku v původním jazyce
Artificial Bee Colony (ABC) algorithm is one of the most recent swarm intelligence based algorithms which simulates the foraging behavior of honey bee colonies. In the present study we propose a simple modification in the basic structure of ABC to enhance the capabilities of virtual bees in locating the potential food sources (ones having sufficient amount of nectar in them). If the virtual bees are unable to locate a good food source even after a particular number of cycles then they are forced towardsanother food source with the help of a small perturbation. The corresponding algorithm is named as C-ABC, where C stands for Cauchy distribution which helps the bees in getting away from food sources which are not so good. Analysis of the proposed C-ABCon 5 standard benchmark problems and 7 non-traditional problems, suggested in the special session of CEC'2008, shows that the incorporation of the proposed scheme considerably improves the performance of basic ABC algorithm. 2011 IEEE.
Název v anglickém jazyce
Cauchy movements for artificial bees for finding better food sources
Popis výsledku anglicky
Artificial Bee Colony (ABC) algorithm is one of the most recent swarm intelligence based algorithms which simulates the foraging behavior of honey bee colonies. In the present study we propose a simple modification in the basic structure of ABC to enhance the capabilities of virtual bees in locating the potential food sources (ones having sufficient amount of nectar in them). If the virtual bees are unable to locate a good food source even after a particular number of cycles then they are forced towardsanother food source with the help of a small perturbation. The corresponding algorithm is named as C-ABC, where C stands for Cauchy distribution which helps the bees in getting away from food sources which are not so good. Analysis of the proposed C-ABCon 5 standard benchmark problems and 7 non-traditional problems, suggested in the special session of CEC'2008, shows that the incorporation of the proposed scheme considerably improves the performance of basic ABC algorithm. 2011 IEEE.
Klasifikace
Druh
D - Stať ve sborníku
CEP obor
IN - Informatika
OECD FORD obor
—
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
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ů
Údaje specifické pro druh výsledku
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
279-284
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
—