Reliability and Cost Optimization of a System with k-out-of-n Configuration and Choice of Decreasing the Components Failure Rates

Article Type:
Research/Original Article (دارای رتبه معتبر)
This paper presents a new redundancy allocation problem for a system with the k-out-of-n configuration at the subsystems’ level with two active and cold standby redundancy strategies. The failure rate of components in each subsystem depends on the number of working components. The components are non-reparable, and the failure rate of the component can be decreased with some preventive maintenance actions. The model has two objective functions: maximizing the system’s reliability and minimizing the system’s costs. The system aims to find the type and number of components in each subsystem, redundancy strategy of subsystems, as well as the decreased values of components failure rates in subsystems. Since the redundancy allocation problem belongs to NP-Hard problems, two Non-Dominated Sorting Genetic Algorithm II (NSGA-II) and Non-Dominated Ranked genetic algorithm (NRGA) metaheuristic algorithms were used to solve the presented model and to tune algorithms parameters we used response surface methodology (RSM). Besides, these algorithms were compared using five different performance metrics. Finally, the hypothesis test was used to analyze the results of the algorithms.
3602 to 3616  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe 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!