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 条
  • [21] Towards efficient local search for the minimum total dominating set problem
    Hu, Shuli
    Liu, Huan
    Wang, Yupan
    Li, Ruizhi
    Yin, Minghao
    Yang, Nan
    APPLIED INTELLIGENCE, 2021, 51 (12) : 8753 - 8767
  • [22] Simulated annealing with stochastic local search for minimum dominating set problem
    Hedar, Abdel-Rahman
    Ismail, Rashad
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2012, 3 (02) : 97 - 109
  • [23] Simulated annealing with stochastic local search for minimum dominating set problem
    Abdel-Rahman Hedar
    Rashad Ismail
    International Journal of Machine Learning and Cybernetics, 2012, 3 : 97 - 109
  • [24] Towards efficient local search for the minimum total dominating set problem
    Shuli Hu
    Huan Liu
    Yupan Wang
    Ruizhi Li
    Minghao Yin
    Nan Yang
    Applied Intelligence, 2021, 51 : 8753 - 8767
  • [25] Algorithm of Strengthened Configuration Checking and Clause Weighting for Solving the Minimum Satisfiability Problem
    Zhou J.-P.
    Ren X.-L.
    Yin Q.
    Li R.-Z.
    Yin M.-H.
    Jisuanji Xuebao/Chinese Journal of Computers, 2018, 41 (04): : 745 - 759
  • [26] A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
    Luo, Mao
    Qin, Huigang
    Wu, Xinyun
    Xiong, Caiquan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (05)
  • [27] An algorithm based on ant colony optimization for the minimum connected dominating set problem
    Bouamama, Salim
    Blum, Christian
    Fages, Jean-Guillaume
    APPLIED SOFT COMPUTING, 2019, 80 : 672 - 686
  • [28] Incremental Evaluation Improvements of The RSN Algorithm for the Minimum Connected Dominating Set Problem
    Liu, Ziwen
    Wu, Xinyun
    PROCEEDINGS OF 2020 IEEE 10TH INTERNATIONAL CONFERENCE ON ELECTRONICS INFORMATION AND EMERGENCY COMMUNICATION (ICEIEC 2020), 2020, : 146 - 149
  • [29] An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network
    Ahn, Namsu
    Park, Sungsoo
    INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2011, 10 (03): : 221 - 231
  • [30] Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set
    Zhang X.
    Li B.
    Cai S.
    Wang Y.
    Journal of Artificial Intelligence Research, 2021, 71 : 89 - 119