Multi-Start Local Search Algorithm for the Minimum Connected Dominating Set Problems

The minimum connected dominating set (MCDS) problem is a very significant NP-hard combinatorial optimization problem, and it has been used in many fields such as wireless sensor networks and ad hoc networks. In this paper, we propose a novel multi-start local search algorithm (MSLS) to tackle the minimum connected dominating set problem. Firstly, we present the fitness mechanism to design the vertex score mechanism so that our algorithm can jump out of the local optimum. Secondly, we use the configuration checking (CC) mechanism to avoid the cycling problem. Then, we propose the vertex flipping mechanism to change the vertex state by combing the CC mechanism with the vertex score mechanism. Finally, we propose a multi-start local search framework based on these mechanisms. We compare the algorithm MSLS with other compared algorithms on extensive instances. The results of experiment show that MSLS is superior to other algorithms in solution quality and time efficiency on most instances.

[1]  Margaret B. Cozzens,et al.  Dominating sets in social network graphs , 1988 .

[2]  Jianan Wang,et al.  An efficient local search for partial vertex cover problem , 2016, Neural Computing and Applications.

[3]  Abdul Sattar,et al.  Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..

[4]  Jie Wu,et al.  Forward-node-set-based broadcast in clustered mobile ad hoc networks , 2003, Wirel. Commun. Mob. Comput..

[5]  Minghao Yin,et al.  GRASP for connected dominating set problems , 2017, Neural Computing and Applications.

[6]  Kaile Su,et al.  Local search for Boolean Satisfiability with configuration checking and subscore , 2013, Artif. Intell..

[7]  Jun Wu,et al.  An Efficient Local Search Algorithm for the Minimum $k$ -Dominating Set Problem , 2018, IEEE Access.

[8]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[9]  Alexandre Salles da Cunha,et al.  Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem , 2014, INFORMS J. Comput..

[10]  Ding-Zhu Du,et al.  On Construction of Virtual Backbone in Wireless Ad Hoc Networks with Unidirectional Links , 2008, IEEE Transactions on Mobile Computing.

[11]  Abilio Lucena,et al.  Reformulations and solution algorithms for the maximum leaf spanning tree problem , 2010, Comput. Manag. Sci..

[12]  Stefan Wuchty,et al.  Controllability in protein interaction networks , 2014, Proceedings of the National Academy of Sciences.

[13]  Sayaka Kamei,et al.  A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set , 2010, Int. J. Found. Comput. Sci..

[14]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[15]  Weili Wu,et al.  A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..

[16]  Jin-Kao Hao,et al.  Iterated two-phase local search for the Set-Union Knapsack Problem , 2019, Future Gener. Comput. Syst..

[17]  Erkki Mäkinen,et al.  A Neural Network Model to Minimize the Connected Dominating Set for Self-Configuration of Wireless Sensor Networks , 2009, IEEE Transactions on Neural Networks.

[18]  Minghao Yin,et al.  An efficient local search framework for the minimum weighted vertex cover problem , 2016, Inf. Sci..

[19]  Milan Tuba,et al.  Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem , 2013, Comput. Sci. Inf. Syst..

[20]  Jean-Guillaume Fages,et al.  An algorithm based on ant colony optimization for the minimum connected dominating set problem , 2019, Appl. Soft Comput..

[21]  Bo Gao,et al.  A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks , 2005, Int. J. Commun. Syst..

[22]  Chittaranjan A. Mandal,et al.  Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[23]  Wei Wu,et al.  Clause States Based Configuration Checking in Local Search for Satisfiability , 2015, IEEE Transactions on Cybernetics.

[24]  Weili Wu,et al.  Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks , 2006, J. Glob. Optim..

[25]  Wei Wu,et al.  CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability , 2015, IEEE Transactions on Computers.

[26]  Hong Tat Ewe,et al.  AN ENHANCED ANT COLONY OPTIMIZATION METAHEURISTIC FOR THE MINIMUM DOMINATING SET PROBLEM , 2006, Appl. Artif. Intell..

[27]  Minghao Yin,et al.  MLQCC: an improved local search algorithm for the set k-covering problem , 2018, Int. Trans. Oper. Res..

[28]  Minghao Yin,et al.  A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity , 2017, Science China Information Sciences.

[29]  Lingmin Wang,et al.  Variable-depth neighborhood search algorithm for the minimum-connected dominating-set problem , 2016 .

[30]  Jin-Kao Hao,et al.  Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem , 2019, Comput. Oper. Res..

[31]  Minghao Yin,et al.  NuMWVC: A novel local search for minimum weighted vertex cover problem , 2018, AAAI.