IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v15y2024i4d10.1007_s13198-023-01905-4.html
   My bibliography  Save this article

Reliability and cost optimization of series–parallel system with metaheuristic algorithm

Author

Listed:
  • Shivani Choudhary

    (Graphic Era Deemed to be University)

  • Mangey Ram

    (Graphic Era Deemed to be University)

  • Nupur Goyal

    (Graphic Era Deemed to be University)

  • Seema Saini

    (Graphic Era Deemed to be University)

Abstract

This study looks into the numerous reliability aspects of a series–parallel system. The designed system is made up of the three subsystems A, B, and C that interconnected in a series–parallel manner. Subsystem B has two units, whereas subsystems A and C have a single unit. Here, the system reliability measures such as reliability, availability, and mean time to failure using Laplace transformation and Markov’s process are evaluated. This study deals with minimize cost while system having the maximum reliability as constraining from one of the metaheuristic algorithms i.e., Particle Swarm Optimization (PSO). Lastly, a numerical example and graphical representation has been shown that the proposed methods are effective and efficient for solving reliability measures and cost problems.

Suggested Citation

  • Shivani Choudhary & Mangey Ram & Nupur Goyal & Seema Saini, 2024. "Reliability and cost optimization of series–parallel system with metaheuristic algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(4), pages 1456-1466, April.
    • Handle: RePEc:spr:ijsaem:v:15:y:2024:i:4:d:10.1007_s13198-023-01905-4
    DOI: 10.1007/s13198-023-01905-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-023-01905-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-023-01905-4?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:ijsaem:v:15:y:2024:i:4:d:10.1007_s13198-023-01905-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.