A Local Search Algorithm with Vertex Weighting Strategy and Two-Level Configuration Checking for the Minimum Connected Dominating Set Problem

被引:0
|
作者
Li, Ruizhi [1 ,2 ,3 ]
He, Jintao [1 ]
Liu, Shangqiong [1 ]
Hu, Shuli [4 ]
Yin, Minghao [4 ]
机构
[1] Jilin Univ Finance & Econ, Sch Management Sci & Informat Engn, Changchun 130117, Peoples R China
[2] Business Big Data Res Ctr Jilin Prov, Changchun 130117, Peoples R China
[3] Jilin Univ, Key Lab Symbol Computat & Knowledge Engn, Minist Educ, Changchun 130012, Peoples R China
[4] Northeast Normal Univ, Sch Comp Sci & Informat Technol, Changchun 130117, Peoples R China
基金
中国国家自然科学基金;
关键词
perturbation strategy; simplification rule; scoring functions; minimum connected dominating set; TABU SEARCH; APPROXIMATION; ALLOCATION;
D O I
10.3390/biomimetics9070429
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The minimum connected dominating set problem is a combinatorial optimization problem with a wide range of applications in many fields. We propose an efficient local search algorithm to solve this problem. In this work, first, we adopt a new initial solution construction method based on three simplification rules. This method can reduce the size of the original graph and thus obtain a high-quality initial solution. Second, we propose an approach based on a two-level configuration checking strategy and a tabu strategy to reduce the cycling problem. Third, we introduce a perturbation strategy and a vertex weighting strategy to help the algorithm be able to jump out of the local optimum effectively. Fourth, we combine the scoring functions Cscore and Mscore with the aforementioned strategies to propose effective methods for selecting vertices. These methods assist the algorithm in selecting vertices that are suitable for addition to or removal from the current candidate solution. Finally, we verify the performance advantages of the local search algorithm by comparing it with existing optimal heuristic algorithms on two sets of instances. The experimental results show that the algorithm exhibits better performance on two sets of classical instances.
引用
收藏
页数:19
相关论文
共 50 条
  • [1] Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
    Wang, Yiyuan
    Cai, Shaowei
    Yin, Minghao
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 5090 - 5094
  • [2] A restart local search algorithm with relaxed configuration checking strategy for the minimum k-dominating set problem
    Li, Ruizhi
    Liu, Siqi
    Wang, Fangzhou
    Gao, Jian
    Liu, Huan
    Hu, Shuli
    Yin, Minghao
    KNOWLEDGE-BASED SYSTEMS, 2022, 254
  • [3] A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem
    Li R.
    He J.
    Lin C.
    Liu Y.
    Hu S.
    Yin M.
    Neural Computing and Applications, 2024, 36 (22) : 13833 - 13852
  • [4] Local Search for MinimumWeight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
    Wang, Yiyuan
    Cai, Shaowei
    Yin, Minghao
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 58 : 267 - 295
  • [5] Local search with edge weighting and configuration checking heuristics for minimum vertex cover
    Cai, Shaowei
    Su, Kaile
    Sattar, Abdul
    ARTIFICIAL INTELLIGENCE, 2011, 175 (9-10) : 1672 - 1696
  • [6] NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set
    Li, Bohan
    Zhang, Xindi
    Cai, Shaowei
    Lin, Jinkun
    Wang, Yiyuan
    Blum, Christian
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 1503 - 1510
  • [7] A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
    Wu, Xinyun
    Lu, Zhipeng
    Glover, Fred
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (02) : 817 - 833
  • [8] A restart local search algorithm with Tabu method for the minimum weighted connected dominating set problem
    Li, Ruizhi
    Wang, Yupan
    Liu, Huan
    Li, Ruiting
    Hu, Shuli
    Yin, Minghao
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2022, 73 (09) : 2090 - 2103
  • [9] Two Weighting Local Search for Minimum Vertex Cover
    Cai, Shaowei
    Lin, Jinkun
    Su, Kaile
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 1107 - 1113
  • [10] An Efficient Local Search Algorithm for the Minimum k-Dominating Set Problem
    Li, Ruizhi
    Liu, Huan
    Wu, Xiaoli
    Wu, Jun
    Yin, Minghao
    IEEE ACCESS, 2018, 6 : 62062 - 62075