ABC-X: a generalized, automatically configurable artificial bee colony framework

The artificial bee colony (ABC) algorithm is a popular metaheuristic that was originally conceived for tackling continuous function optimization tasks. Over the last decade, a large number of variants of ABC have been proposed, making it by now a well-studied swarm intelligence algorithm. Typically,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Swarm intelligence Ročník 11; číslo 1; s. 1 - 38
Hlavní autoři: Aydın, Doğan, Yavuz, Gürcan, Stützle, Thomas
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.03.2017
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Communications Engineering
Computer Communication Networks
Computer Science
Computer Systems Organization and Communication Networks
Intelligence
Mathematical and Computational Engineering
Mathematical models
Networks
Automatic algorithm configuration
Artificial bee colony
Algorithm framework
Continuous optimization
ISSN:1935-3812, 1935-3820
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The artificial bee colony (ABC) algorithm is a popular metaheuristic that was originally conceived for tackling continuous function optimization tasks. Over the last decade, a large number of variants of ABC have been proposed, making it by now a well-studied swarm intelligence algorithm. Typically, in a paper on algorithmic variants of ABC algorithms, one or at most two of its algorithmic components are modified. Possible changes include variations on the search equations, the selection of candidate solutions to be explored, or the adoption of features from other algorithmic techniques. In this article, we propose to follow a different direction and to build a generalized ABC algorithm, which we call ABC-X. ABC-X collects algorithmic components available from known ABC algorithms into a common algorithm framework that allows not only to instantiate known ABC variants but, more importantly, also many ABC algorithm variants that have never been explored before in the literature. Automatic algorithm configuration techniques can generate from this template new ABC variants that perform better than known ABC algorithms, even when their numerical parameters are fine-tuned using the same automatic configuration process.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1935-3812
1935-3820
DOI:10.1007/s11721-017-0131-z