On the Convergence Analysis of Gravitational Search Algorithm
سال انتشار: 1391
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 482
فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JACR-3-2_005
تاریخ نمایه سازی: 16 شهریور 1395
چکیده مقاله:
Gravitational search algorithm (GSA) is one of the newest swarm basedoptimization algorithms, which has been inspired by the Newtonian laws of gravityand motion. GSA has empirically shown to be an efficient and robust stochasticsearch algorithm. Since introducing GSA a convergence analysis of this algorithmhas not yet been developed. This paper introduces the first attempt to a formalconvergence analysis of the standard gravitational search algorithm which involveswith randomness and time varying parameters. In this analysis the behavior of GSAon the facet of mass interaction is considered. The paper provides a formal proofthat each object converges to a stable point.
کلیدواژه ها:
نویسندگان
Farzaneh Ghorbani
Department of Electrical Engineering, Shahid Bahonar University of Kerman, Kerman, Iran
Hossein Nezamabadi-Pour
Department of Electrical Engineering, Shahid Bahonar University of Kerman, Kerman, Iran