Abstract
This paper presents a hybrid evolutionary algorithm with guided mutation (EA/G) to solve the minimum weight dominating set problem (MWDS) which is \(\mathcal {N}\mathcal {P}\)-hard in nature not only for general graphs, but also for unit disk graphs (UDG). MWDS finds practical applications in diverse domains such as clustering in wireless networks, intrusion detection in adhoc networks, multi-document summarization in information retrieval, query selection in web databases etc. EA/G is a recently proposed evolutionary algorithm that tries to overcome the shortcomings of genetic algorithms (GAs) and estimation of distribution algorithms (EDAs) both, and that can be considered as a cross between the two. The solution obtained through EA/G algorithm is further improved through an improvement operator. We have compared the performance of our hybrid evolutionary approach with the state-of-the-art approaches on general graphs as well as on UDG. Computational results show the superiority of our approach in terms of solution quality as well as execution time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aoun B, Boutaba R, Iraqi Y, Kenward G (2006) Gateway placement optimization in wireless mesh networks with QoS constraints. IEEE J Sel Areas Commun 24:2127– 2136
Basagni S (1999) Distributed clustering for ad hoc networks. In: Proceedings ISPAN - 99 International Symposium on Parallel Architectures Algorithms and Networks, pp 310–315
Bevan D, Vaduvur B (1997) Routing in ad-hoc networks using minimum connected dominating sets. In: Proceedings of the 1997 IEEE International Conference on Communications (ICC ’97). IEEE, pp 376–380
Dai D, Yu C (2009) A 5 +𝜖 -approximation algorithm for minimum weighted dominating set in unit disk graph. Theor Comput Sci 410:756–765
Erciyes K, Dagdeviren O, Cokuslu D, Ozsoyeller D (2007) Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks. Appl Comput Math 2:162–180
Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York
Houmaidi M, Bassiouni M (2003) K-weighted minimum dominating sets for sparse wavelength converters placement under non-uniform traffic. In: Proceedings International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, vol MASCOTS03 , pp 56–61
Jovanovic R, Tuba M Simian D (2010) Ant colony optimization applied to minimum weight dominating set problem. In: Proceedings of the 12th WSEAS international conference on Automatic control, modelling and simulation (ACMOS’10), World Scientific and Engineering Academy and Society (WSEAS), Stevens Point. Wisconsin, USA, pp 322–326
Mastrogiovanni M (2007) The clustering simulation framework: a simple manual. http://www.michele-mastrogiovanni.net/software/download/README.pdf
Nocetti F, Gonzalez J, Stojmenovic I (2003) Connectivity-based k-hop clustering in wireless networks. Telecommun Syst 22(1-4):205–220
Potluri A, Singh A (2013) Hybrid metaheuristic algorithms for minimum weight dominating set. Appl Soft Comput 13:76–88
Shen C, Li T (2010) Multi-document summarization via the minimum dominating set. In: Proceedings 23rd International Conference on Computational Linguistics, Coling 2010, pp 984–992
Shyu S, Yin P Y, Lin B (2004) An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann Oper Res 13(1-4):283–304
Subhadrabandhu D, Sarkar S, Anjum F (2004) Efficacy of misuse detection in adhoc networks. In: Proceedings of the First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, pp 97–107
Wang Y, Wang W, Li XZ (2006) Efficient distributed low-cost backbone formation for wireless networks. IEEE Trans Parallel Distrib Syst 17:681–693
Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM 1999), Seattle, USA, pp 7–14
Wu P, Wen JR, Liu H, Ma WY (2006) Query selection techniques for efficient crawling of structured web sources. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE06, p 47
Zhang Q, J S ET (2005) An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans Evol Comput 9:192–200
Zhu X, Wang W, Shan S, Wang Z, Wu W (2012) A ptas for the minimum weighted dominating set problem with smooth weights on unit disk graphs. J Comb Optim 23(4):443–450
Zou F, Wang Y, Xu XH, Li X, Du H, Wan P, Wu W (2011) New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theor Comput Sci 412(3):198–208
Acknowledgments
Authors are grateful to two anonymous reviewers for their valuable comments and suggestions which has helped in improving the quality of this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chaurasia, S.N., Singh, A. A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set. Appl Intell 43, 512–529 (2015). https://doi.org/10.1007/s10489-015-0654-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-015-0654-1