Abstract
The minimum dominating set (MDS) problem is one of the central problems of algorithmic graph theory and has numerous applications especially in graph mining. In this paper, we propose a new hybrid method based on genetic algorithm (GA) to solve the MDS problem, called shortly HGA-MDS. The proposed method invokes a new fitness function to effectively measure the solution qualities. The search process in HGA-MDS uses local search and intensification schemes beside the GA search methodology in order to achieve faster performance. Finally, the performance of the HGA-MDS is compared with the standard GA. The new invoked design elements in HGA-MDS show its promising performance compared with standard GA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baker, J.E.: Adaptive selection methods for genetic algorithms. In: Grefenstette, J.J. (ed.) Proceedings of the First International Conference on Genetic Algorithms, pp. 101–111. Lawrence Erlbaum Associates, Hillsdale (1985)
Burke, E.K., Kendall, G.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer, Berlin (2005)
Carey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. Freeman, New York (1979)
Cooper, C., Klasing, R., Zito, M.: Lower bounds and algorithms for dominating sets in web graphs. Internet Math. 2, 275–300 (2005)
Engelbrecht, A.P.: Computational Intelligence: An Introduction. John Wiley & Sons, Chichester (2003)
Fomin, F.V., Thilikos, D.M.: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. SIAM J. Computing 36, 281–309 (2006)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Grandoni, F.: A note on the complexity of minimum dominating set. J. Discrete Algorithms 4, 209–214 (2006)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs. Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York (1998)
Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artificial Intelligence Review 12, 265–319 (1998)
Ho, C.K., Ewe, H.T.: A hybrid ant colony optimization approach (hACO) for constructing load-balanced clusters. In: IEEE Congress on Evolutionary Computation, pp. 2010–2017 (2005)
Ho, C.K., Singh, Y.P., Ewe, H.T.: An enhanced ant colony optimization metaheuristic for the minimum dominating set problem. Applyed Artificial Intelligence 20, 881–903 (2006)
Holland, J.: Adaptation in Natural and Artifical Systems. University of Michigan Press, Ann Arbor (1975)
Konar, A.: Computational Intelligence: Principles, Techniques and Applications. Springer, Berlin (2005)
Korobitsyn, D.V.: On the complexity of determining the domination number in monogenic classes of graphs. Diskret. Mat. 2, 90–96 (1990); in Russian, translation in Discrete Mathematics and Applications 2, 191–199 (1992)
Lozin, V., Milanič, M.: Domination in Graphs of Low Degree. Rutcor Research Report (RRR) New Jersey 27 (2006)
Müller, H., Brandstädt, A.: NP-completeness of STEINER TREE and DOMINATING SET for chordal bipartite graphs. Theoretical Computer Science 53, 257–265 (1987)
Samuel, H., Zhuang, W.: DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking 14, 154–164 (2009), Springer
Tettamanzi, A., Tomassini, M., Janben, J.: Soft computing: integrating evolutionary, neural, and fuzzy systems. Springer, Berlin (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hedar, AR., Ismail, R. (2010). Hybrid Genetic Algorithm for Minimum Dominating Set Problem. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds) Computational Science and Its Applications – ICCSA 2010. ICCSA 2010. Lecture Notes in Computer Science, vol 6019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12189-0_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-12189-0_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12188-3
Online ISBN: 978-3-642-12189-0
eBook Packages: Computer ScienceComputer Science (R0)