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 条
  • [31] Extraction of Reduced Fault Subspace Based on KDICA and Its Application in Fault Diagnosis
    Kong, Xiangyu
    Yang, Zhiyan
    Luo, Jiayu
    Li, Hongzeng
    Yang, Xi
    [J]. IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2022, 71
  • [32] Fuzzy covering-based rough set on two different universes and its application
    Bin Yang
    [J]. Artificial Intelligence Review, 2022, 55 : 4717 - 4753
  • [33] Fuzzy covering-based rough set on two different universes and its application
    Yang, Bin
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2022, 55 (06) : 4717 - 4753
  • [34] An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
    Ferreira, Alexandre Silvestre
    Pozo, Aurora Trinidad R.
    Goncalves, Richard Aderbal
    [J]. ADCAIJ-ADVANCES IN DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE JOURNAL, 2015, 4 (01): : 1 - 21
  • [35] A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems
    M.J. Brusco
    L.W. Jacobs
    G.M. Thompson
    [J]. Annals of Operations Research, 1999, 86 : 611 - 627
  • [36] A set-covering based heuristic algorithm for the periodic vehicle routing problem
    Cacchiani, V.
    Hemmelmayr, V. C.
    Tricoire, F.
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 163 : 53 - 64
  • [37] Heuristic approaches for the flow-based set covering problem with deviation paths
    Li, Shengyin
    Huang, Yongxi
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2014, 72 : 144 - 158
  • [38] A Weighting-Based Local Search Heuristic Algorithm for the Set Covering Problem
    Gao, Chao
    Weise, Thomas
    Li, Jinlong
    [J]. 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 826 - 831
  • [39] Relationship Between Set Covering Location and Maximal Covering Location Problems in Facility Location Application
    Peng, Huaijun
    Qin, Yong
    Yang, Yanfang
    [J]. PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES FOR RAIL TRANSPORTATION: TRANSPORTATION, 2016, 378 : 711 - 720
  • [40] Single-Valued Neutrosophic Set Correlation Coefficient and Its Application in Fault Diagnosis
    Iryna, Shchur
    Zhong, Yu
    Jiang, Wen
    Deng, Xinyang
    Geng, Jie
    [J]. SYMMETRY-BASEL, 2020, 12 (08):
12345