A novel algorithm named randomized binary gravita- tional 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 SC...A novel algorithm named randomized binary gravita- tional 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 algo- rithm, 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 aigodthm is extended for SCP to solve the fault diagno- sis problem in graph-based systems.展开更多
基金supported by the National Natural Science Foundation of China (4100605850909096)
文摘A novel algorithm named randomized binary gravita- tional 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 algo- rithm, 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 aigodthm is extended for SCP to solve the fault diagno- sis problem in graph-based systems.