Solving the Minimum Dominating Set Problem of Partitioned Graphs Using a Hybrid Bat Algorithm

  • Saad Adnan AbedEmail author
  • Helmi Md. Rais
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1073)


The minimum dominating set (MDS) is the problem of finding the minimum number of nodes that have connections to all other nodes in a given graph. This problem belongs to the NP-complete complexity class that cannot be solved exactly in a polynomial time. Hence, we deployed a stochastic method to estimate good solutions for the MDS in a reasonable time. However, the problem space of the MDS problem grows exponentially with respect to the graph size. Therefore, our proposed method partitions the given graph to sub-graphs that can be tackled independently, which reduces the computational time of finding the MDS solution. This paper investigates the swarm intelligence behaviour represented by a population-based approach called the bat algorithm (BA) to find the smallest set of nodes that dominate the graph. The BA explores a wide area of the search space; thus, it is capable of the diversification procedure. However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore, we included the Simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. To analyse the performance of the proposed partitioning scheme, we experimented with the hybrid algorithm on the graph, with and without partitioning. The gained results showed significant speed up when the partitioning scheme was applied.


Minimum dominating set Graph partitioning Simulated annealing Hybrid methods Bat algorithm 


  1. 1.
    Johnson, D.S., Garey, M.R.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, San Francisco (1979)zbMATHGoogle Scholar
  2. 2.
    Vaishnav, Z.B., Sajja, P.S.: Knowledge-based approach for word sense disambiguation using genetic algorithm for Gujarati. In: Information and Communication Technology for Intelligent Systems, pp. 485–494. Springer, Singapore (2019)Google Scholar
  3. 3.
    Oprişa, C., Cabău, G., Pal, G.S.: Multi-centroid cluster analysis in malware research, pp. 94–103. Springer (2018)Google Scholar
  4. 4.
    Ran, Y., Zhang, Z., Du, H., Zhu, Y.: Approximation algorithm for partial positive influence problem in social network. J. Combin. Optim. 33, 791–802 (2017)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Mohanty, J.P., Mandal, C., Reade, C.: Distributed construction of minimum connected dominating set in wireless sensor network using two-hop information. Comput. Netw. 123, 137–152 (2017)CrossRefGoogle Scholar
  6. 6.
    Taillard, É.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661–673 (1993)CrossRefGoogle Scholar
  7. 7.
    Walshaw, C.: A multilevel approach to the travelling salesman problem. Oper. Res. 50, 862–877 (2002)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Eberhart, R.C., Shi, Y., Kennedy, J.: Swarm intelligence. Elsevier, Amsterdam (2001)Google Scholar
  9. 9.
    Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, MHS 1995, pp. 39–43. (1995)Google Scholar
  10. 10.
    Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern Part B (Cybern.) 26, 29–41 (1996)CrossRefGoogle Scholar
  11. 11.
    Yang, X.-S.: A new metaheuristic bat-inspired algorithm. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), pp. 65–74. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    Hedar, A.-R., Ismail, R.: Simulated annealing with stochastic local search for minimum dominating set problem. Int. J. Mach. Learn. Cybern. 3, 97–109 (2012)CrossRefGoogle Scholar
  13. 13.
    Hedar, A.-R., Ismail, R.: Hybrid genetic algorithm for minimum dominating set problem, pp. 457–467. Springer, Heidelberg (2010)Google Scholar
  14. 14.
    Lin, G., Zhu, W., Ali, M.M.: An Effective Hybrid Memetic Algorithm for the Minimum Weight Dominating Set Problem. IEEE Trans. Evol. Comput. 20, 892–907 (2016)CrossRefGoogle Scholar
  15. 15.
    Ho, C.K., Singh, Y.P., Ewe, H.T.: An enhanced ant colony optimization metaheuristic for the minimum dominating set problem. Appl. Artif. Intell. 20, 881–903 (2006)CrossRefGoogle Scholar
  16. 16.
    Jovanovic, R., Tuba, M.: Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Comput. Sci. Inf. Syst. 10, 133–149 (2013)CrossRefGoogle Scholar
  17. 17.
    Giap, C.N., Ha, D.T.: Parallel genetic algorithm for minimum dominating set problem. In: 2014 International Conference on Computing, Management and Telecommunications (ComManTel), pp. 165–169 (2014)Google Scholar
  18. 18.
    Reimann, M., Doerner, K., Hartl, R.F.: D-ants: savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. 31, 563–591 (2004)CrossRefGoogle Scholar
  19. 19.
    Bettstetter, C.: On the minimum node degree and connectivity of a wireless multihop network. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Amp; Computing, pp. 80–91. ACM, Lausanne (2002)Google Scholar
  20. 20.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Oper. Res. 37, 865–892 (1989)CrossRefGoogle Scholar
  22. 22.
    Sanchis, L.A.: Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica 33, 3–18 (2002)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.High Performance Cloud Computing CenterUniversiti Teknologi PETRONASSeri IskandarMalaysia
  2. 2.Department of Computer and Information SciencesUniversiti Teknologi PETRONASSeri IskandarMalaysia

Personalised recommendations