2019 IEEE Congress on Evolutionary Computation (CEC) 2019
DOI: 10.1109/cec.2019.8789898
|View full text |Cite
|
Sign up to set email alerts
|

Characterizing the Social Interactions in the Artificial Bee Colony Algorithm

Abstract: Computational swarm intelligence consists of multiple artificial simple agents exchanging information while exploring a search space. Despite a rich literature in the field, with works improving old approaches and proposing new ones, the mechanism by which complex behavior emerges in these systems is still not well understood. This literature gap hinders the researchers' ability to deal with known problems in swarms intelligence such as premature convergence, and the balance of coordination and diversity among… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…Some works argue that evaluating the social interaction of simple reactive agents. We can understand the peculiarities of the swarm-based algorithm and probably understand the differences between different versions, rules, and operators [239]- [244]. Besides, the extensive use of benchmark functions to evaluate the search capability of the methods does not help the field to determine the best models to deal with real-world problems.…”
Section: Discussion and Directionsmentioning
confidence: 99%
“…Some works argue that evaluating the social interaction of simple reactive agents. We can understand the peculiarities of the swarm-based algorithm and probably understand the differences between different versions, rules, and operators [239]- [244]. Besides, the extensive use of benchmark functions to evaluate the search capability of the methods does not help the field to determine the best models to deal with real-world problems.…”
Section: Discussion and Directionsmentioning
confidence: 99%
“…The idea, as initially proposed by Zelinka and Davendra [20], is to use graphs whose connections represent interactions amongst the individuals during all generations; vertices are individuals that are activated by other individuals, incrementally from generation to generation. Follow-up work has studied differential evolution [21,22] and particle swarm optimisation methods using this approach [23,24], where the emphasis is to model the communication or influence of individuals (or particles) inside the population or swarm. These network models have been shown to be useful for visualising the behaviour and capturing the trade-off between exploration and exploitation of the studied algorithms.…”
Section: Related Workmentioning
confidence: 99%