A novel algorithm to solve the minimal hitting sets in MBD

Although the advantages of model-based fault diagnosis are becoming more and more obvious in system fault diagnosis, the computation efficiency of minimal hitting sets is the main bottleneck. To improve the calculating speed of existed algorithms and solve the problem of incomplete minimal hitting sets, this paper proposes an improved differential evolution algorithm. Introduction of binary to differential evolution algorithm. The new method takes advantage of the rapid differential evolution algorithm, and adds the minimal assurance strategy to hitting sets in the evolutionary process. Accordingly, the computational efficiency and accuracy of minimal hitting sets are guaranteed. The algorithm is used in the classical digital circuits and traction substation fault diagnosis, and the simulation results show that the speed and accuracy of calculation minimal hitting set is improved. And the efficiency of model-based fault diagnosis is enhanced. In addition, the algorithm can be widely applied to all kinds of system or element fault diagnosis.