The minimum weight vertex cover problem (MWVCP) is one of the most popular combinatorial optimization problems with various real-world applications. Given an undirected graph where each vertex is weighted, the MWVCP is to find a subset of the vertices which cover all edges of the graph and has a minimum total weight of these vertices. In this paper, we propose a multi-start iterated tabu search algorithm (MS-ITS) to tackle MWVCP. By incorporating an effective tabu search method, MS-ITS exhibits several distinguishing features, including a novel neighborhood construction procedure and a fast evaluation strategy. Extensive experiments on the set of public benchmark instances show that the proposed heuristic is very competitive with the state-of-the-art algorithms in the literature.
This paper presents a variable-depth neighborhood search (VDNS) algorithm for solving the minimumconnected dominating-set problem. By considering the problem structure of the minimum-connected dominatingset problem, this paper introduces an effective partition-based neighborhood structure, which consists of a series of basic neighborhood moves, restricts the search space to traverse towards more promising search regions, and generates better solutions during the search. This paper also presents two techniques to further improve the search efficiency of the algorithm: pruning the search branch, and the incremental evaluation technique. Applying the proposed VDNS algorithm to solve the 91 public instances used in the literature, VDNS outperforms the reference algorithms in the literature by improving 38 of the best-known results, demonstrating the efficacy of the proposed VDNS algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.