IDEAS home Printed from https://ideas.repec.org/a/wly/apsmbi/v24y2008i3p185-201.html
   My bibliography  Save this article

Random walk search procedures for reliability optimization of systems with fault tolerance

Author

Listed:
  • Talal M. Alkhamis

Abstract

In this paper we develop two efficient discrete stochastic search methods based on random walk procedure for maximizing system reliability subjected to imperfect fault coverage where uncovered component failures cause immediate system failure, even in the presence of adequate redundancy. The first search method uses a sequential sampling procedure with fixed boundaries at each iteration. We show that this search process satisfies local balance equations and its equilibrium distribution gives most weight to the optimal solution. We also show that the solution that has been visited most often in the first m iterations converges almost surely to the optimal solution. The second search method uses a sequential sampling procedure with increasing boundaries at each iteration. We show that if the increase occurs slower than a certain rate, this search process will converge to the optimal set with probability 1. We consider the system where reliability cannot be evaluated exactly but must be estimated through Monte Carlo simulation. Copyright © 2008 John Wiley & Sons, Ltd.

Suggested Citation

  • Talal M. Alkhamis, 2008. "Random walk search procedures for reliability optimization of systems with fault tolerance," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 24(3), pages 185-201, May.
  • Handle: RePEc:wly:apsmbi:v:24:y:2008:i:3:p:185-201
    DOI: 10.1002/asmb.695
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asmb.695
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asmb.695?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:apsmbi:v:24:y:2008:i:3:p:185-201. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1526-4025 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.