OSA: Orientation Search Algorithm

Document Type: Original Article

Authors

1 shiraz university of technology

2 Dept. of Electrical Engineering Islamic Azad University of Marvdasht, Marvdasht, I.R. Iran.

3 Dept. of Electrical Engineering, University of Calgary, Calgary Alberta Canada Email: maliko@ucalgary.ca

4 Dept. of Electrical and Electronics Engineering, Shiraz University, Shiraz, Iran

5 MSc. Student Dept. of Civil Engineering Islamic Azad Universities of Estahban Estahban, I.R. Iran

Abstract

Random based inventive algorithms are being widely used for optimization. An important category of these algorithms comes from the idea of physical processes or the behavior of beings. A new method for achieving quasi-optimal solutions related to optimization problems in various sciences is proposed in this paper. The proposed algorithm for optimizing the orientation game is a series of optimization algorithms that are formed with the idea of an old game and search operators are an arrangement of players. These players are displaced in a certain space, under the influence of the game referee's orders. The best position is achieved by the laws are there in this game .In this paper, the real version of the algorithm is presented. The results of optimization of a set of standard functions confirm the optimal efficiency of the proposed method, as well as the superiority of the proposed algorithm over the genetic algorithm and the particle swarm optimization algorithm.

Keywords

Main Subjects