Skip to main content

2018 | OriginalPaper | Buchkapitel

A Hybrid Genetic Algorithm for Minimum Weight Dominating Set Problem

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979)MATH M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979)MATH
2.
Zurück zum Zitat R. Bar-Yehuda, S. Moran, On approximation problems related to the independent set and vertex cover problem. Discrete Appl. Math. 9, 1–10 (1984)MathSciNetCrossRef R. Bar-Yehuda, S. Moran, On approximation problems related to the independent set and vertex cover problem. Discrete Appl. Math. 9, 1–10 (1984)MathSciNetCrossRef
3.
Zurück zum Zitat 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 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
4.
Zurück zum Zitat A. Potluri, A. Singh, Hybrid Metaheuristic algorithms for minimum weight dominating set. Appl. Soft Comput. 13(1), 76–88 (2013)CrossRef A. Potluri, A. Singh, Hybrid Metaheuristic algorithms for minimum weight dominating set. Appl. Soft Comput. 13(1), 76–88 (2013)CrossRef
5.
Zurück zum Zitat D. Dai, C. Yu, 5+∈-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor. Comput. Sci. 410, 756–765 (2009)MathSciNetCrossRef D. Dai, C. Yu, 5+∈-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor. Comput. Sci. 410, 756–765 (2009)MathSciNetCrossRef
6.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
7.
Zurück zum Zitat 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)CrossRef 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)CrossRef
8.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
9.
Zurück zum Zitat T.A. El-Mihoub, A.A. Hopgood, L. Nolle, A. Battersby, Hybrid genetic algorithms: a review. Eng. Lett. 13(2), 124–137 (2006) T.A. El-Mihoub, A.A. Hopgood, L. Nolle, A. Battersby, Hybrid genetic algorithms: a review. Eng. Lett. 13(2), 124–137 (2006)
Metadaten
Titel
A Hybrid Genetic Algorithm for Minimum Weight Dominating Set Problem
verfasst von
O. Ugurlu
D. Tanir
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-75408-6_12