Next Article in Journal
On Ulam Stability and Multiplicity Results to a Nonlinear Coupled System with Integral Boundary Conditions
Next Article in Special Issue
SRIFA: Stochastic Ranking with Improved-Firefly-Algorithm for Constrained Optimization Engineering Design Problems
Previous Article in Journal / Special Issue
First-Arrival Travel Times Picking through Sliding Windows and Fuzzy C-Means
Article Menu

Export Article

Open AccessArticle
Mathematics 2019, 7(3), 222;

A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem

School of Computer Science and Information Technology, Northeast Normal University, Changchun 130000, China
Authors to whom correspondence should be addressed.
Received: 14 January 2019 / Revised: 20 February 2019 / Accepted: 24 February 2019 / Published: 27 February 2019
(This article belongs to the Special Issue Evolutionary Computation)
Full-Text   |   PDF [751 KB, uploaded 28 February 2019]   |  
  |   Review Reports


The minimum total dominating set (MTDS) problem is a variant of the classical dominating set problem. In this paper, we propose a hybrid evolutionary algorithm, which combines local search and genetic algorithm to solve MTDS. Firstly, a novel scoring heuristic is implemented to increase the searching effectiveness and thus get better solutions. Specially, a population including several initial solutions is created first to make the algorithm search more regions and then the local search phase further improves the initial solutions by swapping vertices effectively. Secondly, the repair-based crossover operation creates new solutions to make the algorithm search more feasible regions. Experiments on the classical benchmark DIMACS are carried out to test the performance of the proposed algorithm, and the experimental results show that our algorithm performs much better than its competitor on all instances. View Full-Text
Keywords: minimum total dominating set; evolutionary algorithm; genetic algorithm; local search minimum total dominating set; evolutionary algorithm; genetic algorithm; local search

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Yuan, F.; Li, C.; Gao, X.; Yin, M.; Wang, Y. A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem. Mathematics 2019, 7, 222.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Mathematics EISSN 2227-7390 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top