The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches
This work deals with the so-called weighted independent domination problem, which is an NP-hard combinatorial optimization problem in graphs. In contrast to previous theoretical work from the literature, this paper considers the problem from an algorithmic perspective. The first contribution consists in the development of an integer linear programming model and a heuristic that makes use of this model. Second, two greedy heuristics are proposed. Finally, the last contribution is a population-based iterated greedy algorithm that takes profit from the better one of the two developed greedy heuristics. The results of the compared algorithmic approaches show that small problem instances based on random graphs are best solved by an efficient integer linear programming solver such as CPLEX. Larger problem instances are best tackled by the population-based iterated greedy algorithm. The experimental evaluation considers random graphs of different sizes, densities, and ways of generating the node and edge weights.
- 1.Chang, S.C., Liu, J.J., Wang, Y.L.: The weighted independent domination problem in series-parallel graphs. In: Proceedings of ICS 2014 - The International Computer Symposium of Intelligent Systems and Applications, vol. 274, pp. 77–84. IOS Press (2015)Google Scholar
- 3.Wang, Y., Li, R., Zhou, Y., Yin, M.: A path cost-based GRASP for minimum independent dominating set problem. Neural Comput. Appl. (2016, in press)Google Scholar
- 7.Lin, G., Zhu, W., Ali, M.M.: An effective hybrid memetic algorithm for the minimum weight dominating set problem. IEEE Trans. Evol. Comput. (2016, in press)Google Scholar