Heuristic methods for solving redundancy allocation in complex systems

Pardeep Kumar, D.K. Chaturvedi and G.L. Pahuja

International Journal of Reliability and Safety, 2010, vol. 4, issue 2/3, 285-298

Abstract: This paper presents two new heuristic methods for solving constrained redundancy allocation problems in varied complex systems, such as computer networks, communication systems, transportation systems, etc. The first method consists of two steps: selection of optimal path and then determination of optimal redundant subsystem in the chosen path. The second method consists of only one step, i.e. calculation of a sensitivity factor, which considerably reduces the iteration time. Computational results show that the first method consistently performs better than Shi's method in terms of solution quality and computing time. The computational efficiency of the second method far exceeds the existing heuristics.

Keywords: redundancy optimisation; complex networks; heuristics; redundancy allocation; complex systems; optimal path selection; optimal redundant subsystem. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=32449 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijrsaf:v:4:y:2010:i:2/3:p:285-298

Access Statistics for this article

More articles in International Journal of Reliability and Safety from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().