Overview on Binary Optimization Using Swarm-Inspired Algorithms

26Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Swarm Intelligence is applied to optimisation problems due to its robustness, scalability, generality, and flexibility. Based on simple rules, simple reactive agents-swarm (e.g. fish, bird, and ant)-directly or indirectly exchange information to find an optimal solution. Among multiple nature inspirations and versions, the dilemma of choosing proper swarm-based algorithms for each type of problem prevents their recurrent application. This scenario gets even more challenging when considering binary optimisation because of the absence of overview papers that assembles the trends, benefits and limitations of swarm-based techniques. Based on 403 scientific papers, we describe the basis of the leading binary swarm-based algorithms presenting their rationales, equations, pseudocodes, and descriptions of their applications to tackle this research gap. We also define a new classification based on the mechanism to update the solutions and the displacements, indicating that the Binary-Binary approach-binary decision variables and binary search space-is more efficient for binary optimisation in accuracy and computational cost.

Cite

CITATION STYLE

APA

MacEdo, M., Siqueira, H., Figueiredo, E., Santana, C., Lira, R. C., Gokhale, A., & Bastos-Filho, C. (2021). Overview on Binary Optimization Using Swarm-Inspired Algorithms. IEEE Access, 9, 149814–149858. https://doi.org/10.1109/ACCESS.2021.3124710

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free