Computing minimal hitting set based on immune genetic algorithm Online publication date: Sat, 07-Jun-2014
by Gan Zhou; Wenquan Feng; Bofeng Jiang; Chao Li
International Journal of Modelling, Identification and Control (IJMIC), Vol. 21, No. 1, 2014
Abstract: The primary bottleneck of many model-based diagnosis approaches is computing minimal hitting sets (MHSs). Most existing algorithms for computing MHSs are deterministic. Such algorithms are sound and complete but with the complexity of exponential, since the problem of computing MHSs is NP-hard. To reduce the complexity, especially for large systems, we present a novel approach for multiple fault diagnosis, based on an immune genetic algorithm (IGA). This approach maps a hitting set problem onto an integer programming problem, followed by obtaining the lower bound on the size of the solution. The use of the bound in the immune operator guides the MHS search. An elite-set strategy and an appropriate termination criterion are proposed to improve the efficiency of the approach. Experimental results show that our approach solves MHSs faster than the traditional deterministic algorithm in large-scale problems. Compared with the incomplete algorithm, the speed and accuracy of our approach are also significantly improved.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook