A Memtic genetic algorithm for a redundancy allocation problem
عنوان مقاله: A Memtic genetic algorithm for a redundancy allocation problem
شناسه ملی مقاله: SIEC03_023
منتشر شده در سومین همایش ملی مهندسی صنایع و سیستم در سال 1391
شناسه ملی مقاله: SIEC03_023
منتشر شده در سومین همایش ملی مهندسی صنایع و سیستم در سال 1391
مشخصات نویسندگان مقاله:
EbrahimNezhad - Young Researchers club,Qazvin Branch,Islamic Azad University,Qazvin,Iran
Vishkaei - Department of Industrial Engineering, Islamic Azad University, Qazvin Branch, Iran
Shojaei - Department of Industrial Engineering, Islamic Azad University, Abhar Branch, Iran
Hafez - Department of Industrial Engineering, Payame Noor University, Rasht Branch, Iran
خلاصه مقاله:
EbrahimNezhad - Young Researchers club,Qazvin Branch,Islamic Azad University,Qazvin,Iran
Vishkaei - Department of Industrial Engineering, Islamic Azad University, Qazvin Branch, Iran
Shojaei - Department of Industrial Engineering, Islamic Azad University, Abhar Branch, Iran
Hafez - Department of Industrial Engineering, Payame Noor University, Rasht Branch, Iran
In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined.Moghaddam(2008) 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 abi-objective redundancy allocation when the redundancy strategies for subsystems are considered as a variableof the problem. As the problem belongs to the NP-hard class problems, we will present a new approach for thenon-dominated sorting genetic algorithm (NSGAII) and Memtic algorithm(MA) with each to solve the multiobjectivemodel
کلمات کلیدی: Redundancy allocation problems; Series-parallel problems; Redundancy Strategies, Non dominatedsorting genetic algorithms (NSGAII); Memtic algorithms
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/162436/