OSA: Orientation Search Algorithm
سال انتشار: 1398
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 208
فایل این مقاله در 14 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IECO-2-2_003
تاریخ نمایه سازی: 20 تیر 1401
چکیده مقاله:
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.
کلیدواژه ها:
نویسندگان
Mohammad Dehghani
shiraz university of technology
Zeinab Montazeri
Dept. of Electrical Engineering Islamic Azad University of Marvdasht, Marvdasht, I.R. Iran.
Om Parkash Malik
Dept. of Electrical Engineering, University of Calgary, Calgary Alberta Canada Email: maliko@ucalgary.ca
Ali Ehsanifar
Dept. of Electrical and Electronics Engineering, Shiraz University, Shiraz, Iran
Ali Dehghani
MSc. Student Dept. of Civil Engineering Islamic Azad Universities of Estahban Estahban, I.R. Iran