A SIMULATED ANNEALING METHOD FOR FAULT TREE ANALYSIS |
| |
作者姓名: | 刘子先 何桢 贾湖 |
| |
作者单位: | 天津大学管理学院 |
| |
摘 要: | 采用模拟退火方法解最大的最小割集发生概率,同时在寻优过程中找出近优的最小割集,最后确定基本事件的重要性顺序.通过计算机模拟,本算法得到较满意的结果.
|
关 键 词: | 事故分析,最小割集,模拟退火,最小割集概率 |
A SIMULATED ANNEALING METHOD FOR FAULT TREE ANALYSIS |
| |
Abstract: | This paper presents an approximate algorithm based on simulated annealing to achieve the maximum probability of the minimal cut sets for a fault tree. Near optimal minimal cut sets and important sequence of the basic events are also solved by the method. Computer simulations show that the algorithm performs very well. |
| |
Keywords: | fault tree analysis minimal cut set simulated annealing probability of the minimal cut set |
本文献已被 CNKI 等数据库收录! |