Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Design and analysis of the redundancy allocation problem using a greedy technique

Version 1 : Received: 8 July 2016 / Approved: 9 July 2016 / Online: 9 July 2016 (05:13:42 CEST)

How to cite: Nanda, S.; SHARMA, S.; Piyush, K.; SHANKER DEB, A.; Vijayalakshmi, C. Design and analysis of the redundancy allocation problem using a greedy technique. Preprints 2016, 2016070015. https://doi.org/10.20944/preprints201607.0015.v1 Nanda, S.; SHARMA, S.; Piyush, K.; SHANKER DEB, A.; Vijayalakshmi, C. Design and analysis of the redundancy allocation problem using a greedy technique. Preprints 2016, 2016070015. https://doi.org/10.20944/preprints201607.0015.v1

Abstract

We present a very computationally light and fast approximation algorithm and then verify it with genetic algorithm and simulated annealing. We show that our algorithm is on par with GA and SA in terms of output produced while having a tightly bounded time complexity. Our algorithm works best when there is a strong positive correlation between the reliability of a component and its cost. We present two algorithms with the same essence. One of them is system cost bounded and the other is target reliability bounded. Our proposed algorithm works on a subsystem level redundancy instead of component level redundancy.

Keywords

Redundancy Allocation Problem, Genetic Algorithm, Simulated Annealing, Greedy Algorithm

Subject

Computer Science and Mathematics, Data Structures, Algorithms and Complexity

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.