Next Article in Journal
Analysis of Structure-Preserving Discrete Models for Predator-Prey Systems with Anomalous Diffusion
Previous Article in Journal
Graph of Outputs in the Process of Synthesis Directed at CPLDs
Open AccessArticle

Multi-Start Local Search Algorithm for the Minimum Connected Dominating Set Problems

1
School of Computer Science and Technology, Jilin University, Changchun 130012, China
2
School of Management Science and Information Engineering, Jilin University of Finance and Economics, Changchun 130117, China
3
School of Computer Science and Information Technology, Northeast Normal University, Changchun 130024, China
*
Authors to whom correspondence should be addressed.
Mathematics 2019, 7(12), 1173; https://doi.org/10.3390/math7121173
Received: 17 October 2019 / Revised: 11 November 2019 / Accepted: 20 November 2019 / Published: 3 December 2019
The minimum connected dominating set (MCDS) problem is a very significant NP-hard combinatorial optimization problem, and it has been used in many fields such as wireless sensor networks and ad hoc networks. In this paper, we propose a novel multi-start local search algorithm (MSLS) to tackle the minimum connected dominating set problem. Firstly, we present the fitness mechanism to design the vertex score mechanism so that our algorithm can jump out of the local optimum. Secondly, we use the configuration checking (CC) mechanism to avoid the cycling problem. Then, we propose the vertex flipping mechanism to change the vertex state by combing the CC mechanism with the vertex score mechanism. Finally, we propose a multi-start local search framework based on these mechanisms. We compare the algorithm MSLS with other compared algorithms on extensive instances. The results of experiment show that MSLS is superior to other algorithms in solution quality and time efficiency on most instances. View Full-Text
Keywords: minimum connected dominating set; configuration checking; vertex score mechanism; multi-start local search minimum connected dominating set; configuration checking; vertex score mechanism; multi-start local search
MDPI and ACS Style

Li, R.; Hu, S.; Liu, H.; Li, R.; Ouyang, D.; Yin, M. Multi-Start Local Search Algorithm for the Minimum Connected Dominating Set Problems. Mathematics 2019, 7, 1173.

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.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop