Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Johnson, D.S., Garey, M.R.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, San Francisco (1979)
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)
Oprişa, C., Cabău, G., Pal, G.S.: Multi-centroid cluster analysis in malware research, pp. 94–103. Springer (2018)
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)
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)
Taillard, É.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661–673 (1993)
Walshaw, C.: A multilevel approach to the travelling salesman problem. Oper. Res. 50, 862–877 (2002)
Eberhart, R.C., Shi, Y., Kennedy, J.: Swarm intelligence. Elsevier, Amsterdam (2001)
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)
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)
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)
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)
Hedar, A.-R., Ismail, R.: Hybrid genetic algorithm for minimum dominating set problem, pp. 457–467. Springer, Heidelberg (2010)
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)
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)
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)
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)
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)
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)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
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)
Sanchis, L.A.: Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica 33, 3–18 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Abed, S.A., Rais, H.M. (2020). Solving the Minimum Dominating Set Problem of Partitioned Graphs Using a Hybrid Bat Algorithm. In: Saeed, F., Mohammed, F., Gazem, N. (eds) Emerging Trends in Intelligent Computing and Informatics. IRICT 2019. Advances in Intelligent Systems and Computing, vol 1073. Springer, Cham. https://doi.org/10.1007/978-3-030-33582-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-030-33582-3_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33581-6
Online ISBN: 978-3-030-33582-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)