Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
926 8 |
Ultima descărcare din IBN: 2023-05-17 23:01 |
Căutarea după subiecte similare conform CZU |
519.16+519.856 (1) |
Analiză combinatorică. Teoria grafurilor (114) |
Cercetări operaționale (OR) teorii şi metode matematice (168) |
SM ISO690:2012 DOUSH, IyadAbu, HASAN, BasimaHani, AL-BETAR, MohammedAzmi, ALMAGHAYREH, Eslam, ALKHATEEB, Faisal. Artificial Bee Colony with Different Mutation
Schemes: A comparative study. In: Computer Science Journal of Moldova, 2014, nr. 1(64), pp. 77-98. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 1(64) / 2014 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 519.16+519.856 | ||||||
Pag. 77-98 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
Artificial Bee Colony (ABC) is a swarm-based metaheuristic for continuous optimization. Recent work hybridized this algorithm with other metaheuristics in order to improve performance. The work in this paper, experimentally evaluates the use of different mutation operators with the ABC algorithm. The introduced operator is activated according to a determined probability called mutation rate (MR). The results on standard benchmark function suggest that the use of this operator improves performance in terms of convergence speed and quality of final obtained solution. It shows that Power and Polynomial mutations give best results. The fastest convergence was for the mutation rate value (MR=0.2). |
||||||
Cuvinte-cheie Artificial Bee Colony, Meta-heuristic algorithm, Polynomial mutation, Evolutionary Algorithms, Mutation |
||||||
|