STRUCTURAL RELIABILITY ANALYSIS USING CHARGED SYSTEM SEARCH ALGORITHM

Abstract:
This paper focuses on the design point and the failure probability of problems with continuous random variables. The charged system search (CSS) algorithm is utilized as the optimization tool to achieve minimum reliability index under limit state function. In order to acquire the optimal solution, random variables such as elastic modulus, loads, and geometric parameters are selected as decision variables of the problem which are optimized by means of the CSS algorithm. This algorithm is inspired by the Coulomb and Gauss’s laws of electrostatics from physics. In order to evaluate the accuracy and efficiency of this algorithm, several numerical examples are studied and the results are compared to those of the existing methods. The proposed method is capable of finding a design point over the failure surface and calculates the reliability index with a reasonable accurately. As the proposed framework enforces low computational time and holds a satisfactory convergence rate, it is a competent methodology to calculate different types of reliability problems.
Language:
English
Published:
Iranian Journal of Science and Technology Transactions of Civil Engineering, Volume:38 Issue: 2, 2014
Pages:
439 to 448
magiran.com/p1320424  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!