1. Best Couple Algorithm: A New Metaheuristic with Two Types of Equal Size Swarm Splits.
- Author
-
Kusuma, Purba Daru
- Subjects
- *
OPTIMIZATION algorithms , *SWARM intelligence , *RELATIVE motion , *STOCHASTIC processes , *WALRUS - Abstract
As stated in the no-free-lunch (NFL) theory, there is not any optimizer suitable for all problems. This circumstance becomes the motivation of introducing a new swarm-based metaheuristic called best couple algorithm (BCA). BCA is constructed as a swarm-based metaheuristic where the swarm is split into two sub-swarms. There are two types of splitting. The first split is dividing the swarm into the first half and second half of swarms. The second split is dividing the swarm into the odd indexed swarm members and even indexed swarm members. There is a sub swarm leader representing the highest quality swarm member in every sub swarm. There are two sequential searches for every split: the motion toward the middle between two sub swarm leaders and the motion relative to the middle between two randomly picked sub swarm members. In the benchmark assessment, BCA is compared with total interaction algorithm (TIA), coati optimization algorithm (COA), language education algorithm (LEO), osprey optimization algorithm (OOA), and walrus optimization algorithm (WaOA). The result shows that BCA is superior to these five contenders as it is better than TIA, COA, LEO, OOA, and WaOA in 18, 18, 16, 18, and 18 functions respectively out of 23 functions. [ABSTRACT FROM AUTHOR]
- Published
- 2024