Best-Other Algorithm: A Metaheuristic Combining Best Member with Other Entities.

This article introduces a novel stochastic optimization method termed the Best-Other Algorithm (BOA). The nomenclature reflects its reliance on the best member, which is amalgamated with other entities. BOA, a metaphor-free swarm-based metaheuristic, comprises three directed searches. The first involves subtracting the best member from a randomly selected member. The second entails determining the midpoint between the best member, and another randomly chosen member. The third centers around the midpoint between the best member and a random solution along the space. The efficacy of BOA is evaluated by challenging it to solve a collection of 23 functions. In this evaluation, BOA is pitted against five other metaheuristics: Northern Goshawk Optimization (NGO), Zebra Optimization Algorithm (ZOA), Coati Optimization Algorithm (COA), Migration Algorithm (MA), and Osprey Optimization Algorithm (OOA). The findings indicate the superiority of BOA over its counterparts. BOA outperforms NGO, ZOA, COA, MA, and OOA in 21, 15, 16, 15, and 17 functions, respectively. These results underscore the pivotal role of the best member as a reference and the comparatively lesser significance of the neighborhood search as the search space diminishes during the iteration. [ABSTRACT FROM AUTHOR]