By Topic

Gravity-based heuristic for set covering problems and its application in fault diagnosis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yun Li ; Naval University of Engineering, Wuhan 430033, P. R. China; Troops 54645 of the PLA, Zhanjiang 524022, P. R. China ; Zhiming Cai

A novel algorithm named randomized binary gravitational search (RBGS) algorithm is proposed for the set covering problem (SCP). It differs from previous SCP approaches because it does not work directly on the SCP matrix. In the proposed algorithm, the solution of SCP is viewed as multi-dimension position of objects in the binary search space. All objects in the space attract each other by the gravity force, and this force causes a global movement of all objects towards the objects with heavier masses which correspond to good solutions. Computation results show that the proposed algorithm is very competitive. In addition, the proposed algorithm is extended for SCP to solve the fault diagnosis problem in graph-based systems.

Published in:

Journal of Systems Engineering and Electronics  (Volume:23 ,  Issue: 3 )