 Random search algorithms for redundancy allocation problem of a queuing system with maintenance considerationsKamyar Sabri-Laghaie and Mehdi Karimi-Nasab Reliability Engineering and System Safety, 2019, vol. 185, issue C, 144-162 Abstract: The Redundancy Allocation Problem (RAP) is becoming all the time more important in system reliability design. Therefore, RAP has been studied vastly for different systems and under various assumptions. One of the important systems that RAP can be applied to them is queuing systems. In many applications, reliability of queuing systems need to be improved with regard to some queuing and reliability cost constraints. Despite the importance of queuing systems in real world situations, RAP of these systems have not gained attention in the literature. Therefore, RAP of a queuing system with maintenance considerations and including queueing costs in the modeling of RAP is considered in this paper. To find optimal solutions of the problem, four random search algorithms are developed and compared based on the problem structures. According to the experiments, for unimodal solution spaces algorithms 1 and 2 and for multimodal solution spaces algorithms 3 and 4 are recommended. Keywords: Queuing system; Redundancy Allocation Problem (RAP); Standby server; Reliability analysis; Repairman; Random search algorithm (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:185:y:2019:i:c:p:144-162 DOI: 10.1016/j.ress.2018.12.010 Access Statistics for this article Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares More articles in Reliability Engineering and System Safety from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.