Abstract
In recent decades, the redundancy allocation problem (RAP) is becoming an increasingly important issue in the initial stages of planning, designing, and controlling of systems. However, RAP in multi-state system (MSSs) still has some restrictions that components have only two performances: perfect functionality and complete failure. Therefore, this paper formulates a new kind of RAP called repairable redundancy allocation problem (RRAP) in multi-state systems (RRAP in MSSs) to break the restrictions. RRAP in MSSs is nearer to reality and widespread in many critical systems. RRAP in MSSs is not only an NP-hard problem, but also a nonlinear integer optimization problem. In order to deal with RRAP in MSSs in a reasonable time, this paper employs an optimization method of soft computing called simplified swarm optimization (SSO). Finally, the results obtained by SSO have been compared with that obtained from genetic algorithm (GA). Computational results show that the SSO is very competitive and effective in this problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
