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.
Swarm intelligence is a very efficient field for the optimization of high-dimensional functions. Nevertheless, choosing the best swarm-based algorithm is still challenging because it requires expertise in the field. Here, we propose to use reinforcement learning to dynamically select the swarm-based techniques to solve a benchmark function based on the current simulation state. First, we created a swarm capable of modifying its metaphor over iteration. Next, we created a reinforcement learning environment to solve benchmark functions. Then, we trained Proximal Policy Optimization to select the well-suited metaheuristic (GWO, GPSO or LPSO) to solve Rastrigin and F3 based on the information retrieved from the simulation. Our proposal reached competitive results in all simulated scenarios. Moreover, we found that the use of GPSO is consistently more efficient at the middle of the convergence and that using GWO is more efficient than using the other selected algorithms at the beginning of the convergence. Future works will bring us more robustness in combining swarm-based techniques while decreasing the computational cost. Thus, we show that reinforcement learning has the potential to overcome the effort of choosing the well-suited metaheuristic for a specific problem.