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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
