General Relativity Search Algorithm for Optimization in Real Numbers Space
سال انتشار: 1393
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,045
فایل این مقاله در 9 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CITCONF02_203
تاریخ نمایه سازی: 19 اردیبهشت 1395
چکیده مقاله:
In this paper a novel evolutionary optimization algorithm inspired by General Relativity Theory (GRT) is introduced. This optimization method is called General Relativity Search Algorithm (GRSA). In GRSA, a population of particles (agents) is considered in a space free from all external non-gravitational fields. These agents evolve toward a position with least Action. Based on GRT, a system of particles has conserved mass and each of which moves along geodesic trajectories in a curved spacetime. According to physical action principle, a system of particles goes to a position with minimum action. By inspiring these notions, GRSA will make solution agents move toward the optimal point of an optimization problem. Performance of the proposed optimization algorithm is investigated by using several standard test functions. Effectiveness and abilities of the algorithm to solve optimization problems is shown through a comparative study with two well-known heuristic search methods, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Numerical simulation results demonstrate the efficiency, robustness and convergence speed of GRSA in solving various functions.
کلیدواژه ها:
نویسندگان
Hamzeh Beiranvand
Dept. of Electrical Engineering, Lorestan University, Iran
Esmaeel Rokrok
Dept. of Electrical Engineering, Lorestan University, Iran
Karim Beiranvand
Dept. of Electrical and Computer Engineering, Jundi-Shapur University of technology, Iran