AN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM

Author(s):
Message:
Abstract:
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artificial fish swarm algorithm (GS-AFSA). This algorithm has been applied to three different discrete truss optimization problems. The optimization results are compared with those obtained using the standard GSO, the AFSA and the quick group search optimizer (QGSO). The proposed GS-AFSA eliminated the shortcomings of GSO regarding falling into the local optimum by taking advantage of AFSA’s stable convergence characteristics and achieving a better convergence rate and convergence accuracy than the GSO and the AFSA. Furthermore, the GS-AFSA has a superior convergence accuracy compared to the QGSO, all while solving a complicated structural optimization problem containing numerous design variables.
Language:
English
Published:
International Journal of Optimization in Civil Engineering, Volume:5 Issue: 1, Winter 2015
Pages:
37 to 52
magiran.com/p1370606  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!