A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem
AbstractThe 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
Share & Cite This Article
Yuan, F.; Li, C.; Gao, X.; Yin, M.; Wang, Y. A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem. Mathematics 2019, 7, 222.
Yuan F, Li C, Gao X, Yin M, Wang Y. A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem. Mathematics. 2019; 7(3):222.Chicago/Turabian Style
Yuan, Fuyu; Li, Chenxi; Gao, Xin; Yin, Minghao; Wang, Yiyuan. 2019. "A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem." Mathematics 7, no. 3: 222.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.