A hybrid heuristic for dominating tree problem

作者：Chaurasia Sachchida Nand; Singh Alok^*

来源：Soft Computing, 2016, 20(1): 377-397.

DOI：10.1007/s00500-014-1513-4

• Constrained optimization
• Dominating tree
• Estimation of distribution algorithm
• Guided mutation
• Heuristic

Given an undirected, connected, edge-weighted graph, the dominating tree problem (DTP) seeks on this graph a tree of minimum weight such that each node of the graph either belongs to the tree or is adjacent to a node in the tree. This problem is -hard. In this paper, we present an evolutionary algorithm with guided mutation (EA/G) to solve the DTP. This problem has several practical applications in the field of wireless sensor networks. EA/G is a recently proposed evolutionary algorithm that tries to overcome the shortcomings of genetic algorithms (GAs) and estimation of distribution algorithms both, and has the characteristics of both. We have compared the performance of our proposed approach with the state-of-the-art approaches presented in the literature. Computational results show the superiority of our approach in terms of solution quality as well as execution time.

• 出版日期2016-1