IDEAS home Printed from https://ideas.repec.org/a/vrs/repfms/v21y2013ispecial_issuep78-83n13.html
   My bibliography  Save this article

Fault Tree Analysis Optimized by Genetic Algorithms

Author

Listed:
  • Libošvárová Adriana

    (Institute of Applied Informatics, Automation and Mathematics, Faculty of Materials Science and Technology, Slovak University of Technology in Bratislava, Paulínska 16, 917 24 Trnava, Slovakia)

  • Schreiber Peter

    (Institute of Applied Informatics, Automation and Mathematics, Faculty of Materials Science and Technology, Slovak University of Technology in Bratislava, Paulínska 16, 917 24 Trnava, Slovakia)

Abstract

This paper deals with possibilities of using genetic algorithms in design of costs optimization, which are needed to reach given reliability of technical system, respectively system reliability optimization by given amount of investment costs. In following chapters, there is a described design of new method, which will be later implemented in application and verified on an example.Causal relationships between system failures and elements faults can be detected by analytic approach, when at first the undesired system fault is identified and its reasons are progressively detected. The reliability of system and its elements is analyzed using method FTA (fault tree analysis) and system is represented by fault trees. In order to optimize costs, respectively reliability, the genetic algorithms are used.

Suggested Citation

  • Libošvárová Adriana & Schreiber Peter, 2013. "Fault Tree Analysis Optimized by Genetic Algorithms," Research Papers Faculty of Materials Science and Technology Slovak University of Technology, Sciendo, vol. 21(Special-I), pages 78-83, June.
    • Handle: RePEc:vrs:repfms:v:21:y:2013:i:special_issue:p:78-83:n:13
    DOI: 10.2478/rput-2013-0013
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/rput-2013-0013
    Download Restriction: no
    File URL: https://libkey.io/10.2478/rput-2013-0013?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:vrs:repfms:v:21:y:2013:i:special_issue:p:78-83:n:13. 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: Peter Golla (email available below). General contact details of provider: https://www.sciendo.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.