Minimal cut sets identification by hierarchical differential evolution - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Minimal cut sets identification by hierarchical differential evolution

Résumé

Minimal cut sets (mcs) identification in Fault Trees (FTs) of large, real systems is not trivial. In this work, we transform the problem of mcs identification into an optimization problem. We do so by hierarchically looking for the minimum combination of cut sets that can guarantee the best coverage of all the minterms that make the system fail. A multiple-population, parallel search policy based on a Differential Evolution (DE) algorithm is developed and applied to a case study considering the Airlock System (AS) of a CANDU reacto
Fichier non déposé

Dates et versions

hal-04366329 , version 1 (28-12-2023)

Identifiants

  • HAL Id : hal-04366329 , version 1

Citer

Francesco Di Maio, Samuele Baronchelli, Enrico Zio. Minimal cut sets identification by hierarchical differential evolution. International Topical Meeting on Probabilistic Safety Assessment and Analysis 2013, PSA 2013, Sep 2013, Columbia, SC, France. pp.614-625. ⟨hal-04366329⟩
8 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More