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

被引：4
|
作者：
Li, Yun [1 ,2 ]
Cai, Zhiming [1 ]
机构：
[1] Naval Univ Engn, Wuhan 430033, Peoples R China
[2] Troops 54645 PLA, Zhanjiang 524022, Peoples R China
来源：
JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS | 2012年 / 23卷 / 03期
基金：
中国国家自然科学基金;
关键词：
set covering problem (SCP); gravity force; binary search space; fault diagnosis; GENETIC ALGORITHM; SEARCH ALGORITHM;
D O I：
10.1109/JSEE.2012.00049
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：391 / 398
页数：8
相关论文
共 50 条
  • [1] Gravity-based heuristic for set covering problems and its application in fault diagnosis
    Yun Li1
    2.Troops 54645 of the PLA
    [J]. Journal of Systems Engineering and Electronics, 2012, 23 (03) : 391 - 398
  • [2] Rough set-based heuristic hybrid recognizer and its application in fault diagnosis
    Geng, Zhiqiang
    Zhu, Qunxiong
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) : 2711 - 2718
  • [3] A SURROGATE HEURISTIC FOR SET COVERING PROBLEMS
    LORENA, LAN
    LOPES, FB
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 79 (01) : 138 - 150
  • [4] A LAGRANGIAN HEURISTIC FOR SET-COVERING PROBLEMS
    BEASLEY, JE
    [J]. NAVAL RESEARCH LOGISTICS, 1990, 37 (01) : 151 - 164
  • [5] AN EFFICIENT HEURISTIC FOR LARGE SET COVERING PROBLEMS
    VASKO, FJ
    WILSON, GR
    [J]. NAVAL RESEARCH LOGISTICS, 1984, 31 (01) : 163 - 171
  • [6] A HEURISTIC ALGORITHM FOR THE MULTICRITERIA SET-COVERING PROBLEMS
    LIU, YH
    [J]. APPLIED MATHEMATICS LETTERS, 1993, 6 (05) : 21 - 23
  • [7] A New Direct Coefficient-Based Heuristic Algorithm for Set Covering Problems
    Ahmad Hashemi
    Hamed Gholami
    Uday Venkatadri
    Sasan Sattarpanah Karganroudi
    Samer Khouri
    Adam Wojciechowski
    Dalia Streimikiene
    [J]. International Journal of Fuzzy Systems, 2022, 24 : 1131 - 1147
  • [8] A set-covering-based heuristic approach for bin-packing problems
    Monaci, M
    Toth, P
    [J]. INFORMS JOURNAL ON COMPUTING, 2006, 18 (01) : 71 - 85
  • [9] A New Direct Coefficient-Based Heuristic Algorithm for Set Covering Problems
    Hashemi, Ahmad
    Gholami, Hamed
    Venkatadri, Uday
    Karganroudi, Sasan Sattarpanah
    Khouri, Samer
    Wojciechowski, Adam
    Streimikiene, Dalia
    [J]. INTERNATIONAL JOURNAL OF FUZZY SYSTEMS, 2022, 24 (02) : 1131 - 1147
  • [10] A Lagrangian-based heuristic for large-scale set covering problems
    Ceria, S
    Nobili, P
    Sassano, A
    [J]. MATHEMATICAL PROGRAMMING, 1998, 81 (02) : 215 - 228
12345