Abstract
Minimum Weight Dominating Set (MWDS) belongs to the class of NP-hard graph problem which has several real life applications especially in wireless networks. In this paper, we present a new hybrid genetic algorithm. Also, we propose a new heuristic algorithm for MWDS to create initial population. We test our hybrid genetic algorithm on (Jovanovic et al., Proceedings of the 12th WSEAS international conference on automatic control, modeling and simulation, 2010) [3] data set. Then the results are compared with existing algorithms in the literature. The experimental results show that our hybrid genetic algorithm can yield better solutions than these algorithms and faster than these algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979)
R. Bar-Yehuda, S. Moran, On approximation problems related to the independent set and vertex cover problem. Discrete Appl. Math. 9, 1–10 (1984)
R. Jovanovic, M. Tuba, D. Simian, Ant colony optimization applied to minimum weight dominating set problem, in Proceedings of the 12th WSEAS International Conference on Automatic Control, Modeling and Simulation (World Scientific and Engineering Academy and Society (WSEAS), 2010), pp. 322–326
A. Potluri, A. Singh, Hybrid Metaheuristic algorithms for minimum weight dominating set. Appl. Soft Comput. 13(1), 76–88 (2013)
D. Dai, C. Yu, 5+∈-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor. Comput. Sci. 410, 756–765 (2009)
F. Zou, Y. Wang, X.-H. Xu, X. Li, H. Du, P. Wan, W. Wu, New approximation for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theor. Comput. Sci. 412(3), 198–208 (2011)
Y. Wang, W. Wang, X.-Y. Li, Efficient distributed low-cost backbone formation for wireless networks. IEEE Trans. Parallel Distrib. Syst. 17(7), 681–693 (2006)
X. Zhu, W. Wang, S. Shan, Z. Wang, W. Wu, A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs. J. Comb. Optim. 23(4), 443–450 (2012)
T.A. El-Mihoub, A.A. Hopgood, L. Nolle, A. Battersby, Hybrid genetic algorithms: a review. Eng. Lett. 13(2), 124–137 (2006)
Acknowledgements
The authors were supported in part by TUBITAK (The Scientific and Technological Research Council of Turkey) fellowship. The authors also would like to thank anonymous referees for helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Ugurlu, O., Tanir, D. (2018). A Hybrid Genetic Algorithm for Minimum Weight Dominating Set Problem. In: Zadeh, L., Yager, R., Shahbazova, S., Reformat, M., Kreinovich, V. (eds) Recent Developments and the New Direction in Soft-Computing Foundations and Applications. Studies in Fuzziness and Soft Computing, vol 361. Springer, Cham. https://doi.org/10.1007/978-3-319-75408-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-75408-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-75407-9
Online ISBN: 978-3-319-75408-6
eBook Packages: EngineeringEngineering (R0)