IDEAS home Printed from https://ideas.repec.org/a/sae/risrel/v237y2023i1p152-165.html
   My bibliography  Save this article

Optimizing a joint reliability-redundancy allocation problem with common cause multi-state failures using immune algorithm

Author

Listed:
  • Mani Sharifi
  • Ali Sayyad
  • Sharareh Taghipour
  • Abdolreza Abhari

Abstract

Redundancy-reliability allocation problem (RRAP) is a well-known problem in reliability area. In general, this problem aims to maximize a system’s reliability or minimize a system’s costs under some constraints. In this paper, we develop a RRAP for a series-parallel system with multi-state components. Thus, the subsystems’ components, the system’s subsystems, and the system have different working states with corresponding working probabilities. The RAP in the paper is a RAP with mix components (RAPMC). We consider the choice of allocating non-identical components to each sub-system. Moreover, we consider the common cause failure (CCF) for the components, which causes simultaneous failure of all identical components of a subsystem. We assume the component’s failure state probability is reduced by conducting technical activities, and the reduced probability is added to the component’s working states’ probabilities. The model’s objective function is to minimize the system’s costs under a minimum reliability level and other constraints by allocating the optimal set of components to each subsystem and determining each component’s technical activities level. Since the RRAP belongs to the Np-Hard category of problems, an immune algorithm is used to solve the developed problem. The results indicate considering the technical activities decreases the system’s costs.

Suggested Citation

  • Mani Sharifi & Ali Sayyad & Sharareh Taghipour & Abdolreza Abhari, 2023. "Optimizing a joint reliability-redundancy allocation problem with common cause multi-state failures using immune algorithm," Journal of Risk and Reliability, , vol. 237(1), pages 152-165, February.
  • Handle: RePEc:sae:risrel:v:237:y:2023:i:1:p:152-165
    DOI: 10.1177/1748006X221078128
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1748006X221078128
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1748006X221078128?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
    ---><---

    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:sae:risrel:v:237:y:2023:i:1:p:152-165. 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: SAGE Publications (email available below). General contact details of provider: .

    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.