:: دوره 2، شماره 2 - ( 3-1391 ) ::
جلد 2 شماره 2 صفحات 0-0 برگشت به فهرست نسخه ها
A Memtic genetic algorithm for a redundancy allocation problem
چکیده:   (13437 مشاهده)
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for subsystems are considered as a variable of the problem. As the problem belongs to the NP-hard class problems, we will present a new approach for the non-dominated sorting genetic algorithm (NSGAII) and Memtic algorithm (MA) with each one to solve the multi-objective model. Keywords: Redundancy Allocation Problems, Series-Parallel Problems, Redundancy Strategies, Non Dominated Sorting Genetic Algorithms (NSGAII), Memtic Algorithms.
متن کامل [PDF 485 kb]   (4671 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: تخصصي
دریافت: 1391/3/22 | انتشار: 1391/3/26


XML   English Abstract   Print



بازنشر اطلاعات
Creative Commons License این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است.
دوره 2، شماره 2 - ( 3-1391 ) برگشت به فهرست نسخه ها