A novel local search algorithm for the minimum capacitated dominating set. Issue 6 (3rd June 2018)

• Record Type: Journal Article
• Authors: Li, Ruizhi; Hu, Shuli; Zhao, Peng; Zhou, Yupeng; Yin, Minghao
• Is Part Of: Journal of the Operational Research Society. Volume 69:Issue 6(2018)
• Page Start: 849
• Page End: 863
• Publication Date: 2018-06-03
• Subjects: Local search -- vertex penalizing -- capacitated dominating set -- intensification scheme; Operations research -- Periodicals; 658.4034
• DOI: 10.1057/s41274-017-0268-6
• Languages: English
• ISSNs: 0160-5682

Abstract

Abstract: The minimum capacitated dominating set problem, an extension of the classic minimum dominating set problem, is an important NP-hard combinatorial optimization problem with a wide range of applications. The aim of this paper is to design a novel local search algorithm to solve this problem. First, the vertex penalizing strategy is introduced to define the scoring method so that our algorithm could increase the diversity of the solutions. Accordingly, a two-mode dominated vertex selecting strategy is introduced to choose the dominated vertices by the added vertex to achieve more promising solutions. After that, an intensification scheme is proposed to make full use of the capacity of each vertex and to improve the solutions effectively. Based on these strategies, a novel local search framework, as we call local search based on vertex penalizing and two-mode dominated vertex selecting strategy (LS_PD), is presented. LS_PD is evaluated against several state-of-the-art algorithms on a large collection of benchmark instances. The experimental results show that in most benchmark instances, LS_PD performs better than its competitors in terms of both solution quality and computational efficiency.