GRASP for connected dominating set problems

Li, Ruizhi; Hu, Shuli; Gao, Jian; Zhou, Yupeng; Wang, Yiyuan; Yin, Minghao

doi:10.1007/s00521-016-2429-y

Cited by 30 publications

(21 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The ASS-MCDS method is programmed using MATLAB. In this experimental section, the effectiveness of ASS-MCDS method is analyzed on several test graphs from the literature [1,11,12,21]. These graphs are given as ad hoc wireless network clustering instances, which are described in Table 1.…”

Section: Resultsmentioning

confidence: 99%

“…In this section, the algorithmic performance of the proposed method introduced in Algorithm 2 is investigated by comparing the results of ASS-MCDS against the results of other benchmark methods presented in [1,11,12,21]. To measure the performance of the ASS-MCDS, two different quantities are used to make comparisons: The maximum number of iterations for the ASS-MCDS is 20 for each graph.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…In recent years, developing meta-heuristics to construct MCDS has attracted many researchers. A greedy randomized adaptive search procedure for solving the MCDS problem is designed by Li et al [21]. In [1], authors proposed ant colony optimization algorithms for the MCDS.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

et al. 2020

View full text Add to dashboard Cite

An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominating set (MCDS), where the searching space for finding a route is restricted to nodes in this MCDS. Thus, finding MCDS in a WSN provides a flexible low-cost solution for the problem of event monitoring, particularly in places with limited or dangerous access to humans as is the case for most WSN deployments. In this paper, we proposed an adaptive scatter search (ASS-MCDS) algorithm that finds the near-optimal solution to this problem. The proposed method invokes a composite fitness function that aims to maximize the solution coverness and connectivity and minimize its cardinality. Moreover, the ASS-MCDS methods modified the scatter search framework through new local search and solution update procedures that maintain the search objectives. We tested the performance of our proposed algorithm using different benchmark-test-graph sets available in the literature. Experiments results show that our proposed algorithm gave good results in terms of solution quality.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Numerical Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The MCDS problem was also solved by neural networks method [26], simulated annealing with tabu search [27], and the ACO algorithm [28,29]. Li et al proposed the algorithm GRASP, which incorporates an efficient local search algorithm based on two key components (the tabu strategy and the greedy function) [30]. Wang et al presented a variable-depth neighborhood search (VDNS) algorithm for solving the MCDS problem [31].…”

Section: Introductionmentioning

confidence: 99%

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

Liu

et al. 2019

Mathematics

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…Jovanovic & Tuba (2013) proposed two heuristics based on the ant colony algorithm, the first one is a Min-Max Ant System, while the second one is an ACO with a pheromone correction strategy, which was first proposed in Jovanovic et al (2010) for the MWDS problem. Wu et al (2017) and Li et al (2017) proposed, respectively, a restricted swap-based neighborhood structure and a greedy randomized adaptive search procedure (GRASP) based on a greedy function to solve the MCDS problem. Both methods improve the solutions, by using strategies to forbid cycling in the space search.…”

Section: Minimum Connected Dominating Set Problemmentioning

confidence: 99%

Matheuristics for Variants of the Dominating Set Problem

ALBUQUERQUE¹

View full text Add to dashboard Cite

GRASP for connected dominating set problems

Cited by 30 publications

References 32 publications

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

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

Matheuristics for Variants of the Dominating Set Problem

Contact Info

Product

Resources

About