GRASP for connected dominating set problems

The minimum connected dominating set problem, a variant of the classical minimum dominating set problem, is a very significant NP-hard combinatorial optimization problem with a number of applications. To address this problem, a greedy randomized adaptive search procedure (GRASP) that incorporates a novel local search procedure based on greedy function and tabu strategy is proposed. Firstly, the greedy function is proposed to define the score of each vertex so that our algorithm could obtain different possible optimal solutions. Secondly, a tabu strategy is introduced to prevent the search trapping into the local minimum and avoid the cycling problems. The proposed algorithm is evaluated against several state-of-art algorithms on a large collection of benchmark instances. The experimental results prove that GRASP performs better than its competitors in most benchmark instances.

[1]  Colin Cooper,et al.  Lower Bounds and Algorithms for Dominating Sets in Web Graphs , 2005, Internet Math..

[2]  Xiuzhen Cheng,et al.  An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks , 2004 .

[3]  Jianan Wang,et al.  Two Local Search Algorithms for Partition Vertex Cover Problem , 2016 .

[4]  R. Ramalakshmi,et al.  Energy efficient Connected Dominating Set construction using Ant Colony Optimization technique in Wireless Sensor Network , 2015, 2015 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS).

[5]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[6]  Vic Grout,et al.  Metaheuristics for Wireless Network Optimisation , 2007, The Third Advanced International Conference on Telecommunications (AICT'07).

[7]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

[8]  Minghao Yin,et al.  A path cost-based GRASP for minimum independent dominating set problem , 2017, Neural Computing and Applications.

[9]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[10]  Xin Zhang,et al.  Local search algorithm with path relinking for single batch-processing machine scheduling problem , 2017, Neural Computing and Applications.

[11]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[13]  Jacob Goldenberg,et al.  Using Complex Systems Analysis to Advance Marketing Theory Development , 2001 .

[14]  Minghao Yin,et al.  Animal migration optimization: an optimization algorithm inspired by animal migration behavior , 2014, Neural Computing and Applications.

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

[16]  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.

[17]  Minghao Yin,et al.  A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem , 2017, Neural Computing and Applications.

[18]  Aravind Srinivasan,et al.  Modelling disease outbreaks in realistic urban social networks , 2004, Nature.

[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]  Minghao Yin,et al.  Two Efficient Local Search Algorithms for Maximum Weight Clique Problem , 2016, AAAI.

[21]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[22]  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.

[23]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[24]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[25]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[26]  Xiangtao Li,et al.  Self-adaptive constrained artificial bee colony for constrained numerical optimization , 2012, Neural Computing and Applications.

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[28]  Jianan Wang,et al.  The Community Structure of the Constraint Satisfaction Problem Instances of Model RB , 2015 .

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

[30]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part Ii: Applications , 2022 .

[31]  A. Weil,et al.  Diffusion of Innovation , 2020, The International Encyclopedia of Media Psychology.

[32]  Sandip Roy,et al.  The influence model , 2001 .

[33]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

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

[35]  Michael R. Fellows,et al.  Parameterized approximation of dominating set problems , 2008, Inf. Process. Lett..

[36]  Xiangtao Li,et al.  Enhancing the performance of cuckoo search algorithm using orthogonal learning method , 2013, Neural Computing and Applications.

[37]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[38]  E. Ann Stanley,et al.  Social Networks and Mathematical Modeling , 2006 .

[39]  Panos M. Pardalos,et al.  A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks , 2004 .

[40]  M. Resende,et al.  Greedy Randomized Adaptive Search Procedures. , 2003 .

[41]  Panos M. Pardalos,et al.  A New Algorithm for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks , 2015 .

[42]  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..

[43]  Thomas W. Valente.  Network models of the diffusion of innovations , 1996, Comput. Math. Organ. Theory.

[44]  Minghao Yin,et al.  A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem , 2017, Int. Trans. Oper. Res..

[45]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..