An Understanding of Artificial Bee Colony Algorithm from the Perspective of Computation and Applied Mathematics: A Comparative Study

In the recent past, one of the swarm-based algorithms that have been introduced is Artificial Be Colony (ABC) algorithms. The role of ABC lies in the stimulation of honeybee swarms' intelligent foraging behavior. This study applied the ABC algorithm toward large numerical test function optimiza...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of physics. Conference series Ročník 1362; číslo 1; s. 12132 - 12134
Hlavní autori: Mohammed, Ali Hassan, Yasir, Asmahan Abed
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Bristol IOP Publishing 01.11.2019
Predmet:
Algorithms
Applications of mathematics
Applied mathematics
Comparative studies
Evolutionary algorithms
Evolutionary computation
Genetic algorithms
Particle swarm optimization
Physics
Search algorithms
ISSN:1742-6588, 1742-6596
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In the recent past, one of the swarm-based algorithms that have been introduced is Artificial Be Colony (ABC) algorithms. The role of ABC lies in the stimulation of honeybee swarms' intelligent foraging behavior. This study applied the ABC algorithm toward large numerical test function optimization. Also, the results were compared with those that had been reported by experimental studies employing evolution strategies, differential evolution algorithm, particle swarm optimization algorithm, and genetic algorithm. From the findings, the study established that ABC exhibits superior performance compared to population-based algorithms, with other situations also witnessing the algorithm's performance likened to or similar to the population-based algorithms. The factor that explained the superiority of the ABC algorithm was that it employs fewer control parameters.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1362/1/012132