BOSA: Binary Orientation Search Algorithm

Abstract

Optimization algorithms have many applications in solve the optimization problems in various sciences. The Orientation Search Algorithm (OSA) is an optimizer that is simulated the rules of a game called orientation game. In OSA searcher agent are players of orientation game that moves on the playground depending on the direction of the referee. in this study, binary model of OSA which called Binary Orientation Search Algorithm (BOSA) is proposed. BOSA and eight other algorithms (BGA, BPSO, BGSA, BGOA, BBA, BMOA, and BDA) are tested on twenty-three Benchmark test function. Proposed BOSA has a high ability to solve optimization problems compared to other algorithms according to the evaluation results.