Multi-start iterated tabu search for the minimum weight vertex cover problem

Zhou, Taoqing; Lu, Zhengding; Wang, Yan; Ding, Junwen; Peng, Bo

doi:10.1007/s10878-015-9909-3

Cited by 23 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Systematic experimental analysis of our algorithm using four sets of 198 benchmark instances produced excellent results. More specifically, for 126 public benchmark instances, MAE-HTS obtained improved solutions for 2 instances and matched the best known solutions for the remaining 124 ones when compared with state-of-the-art reference algorithms [2], [3], [14], [19], [38] and the Gurobi MIP solver, while for 72 additional large scale instances, MAE-HTS is able to find the best solutions for 64 instances. To obtain additional insights into the distinctive features of the algorithm and computational bottlenecks, we examined the role of each of the major components of our algorithm individually through systematic experimentation.…”

Section: Introductionmentioning

confidence: 87%

“…For each cycle, solutions (individuals) that form the initial population are generated by a greedy randomized constructive scheme, which is adapted from the GRASP algorithm [7], [27]. First, we apply the concept of key-vertices introduced in [38] to denote vertices that belong to set V while non-key-vertices denote the remaining ones. In fact, any vertex can be denoted as a key-vertex or a non-key-vertex.…”

Section: Algorithm 2 Framework Of the Graph Reductions For The Mwvcpmentioning

confidence: 99%

“…• MS-ITS by Zhou et al [38] • DLSWCC by Li et al [19] • NuMWVC by Li et al [18] and an ILP solver Gurobi 9.1.…”

Section: B Comparison With State-of-the-art Algorithmsmentioning

confidence: 99%

“…Up to 2012, a number of algorithms have been proposed based on greedy constructions [31], ant colony optimization approaches [14], [30] and population-based iterated greedy strategies [3]. In 2015, Zhou et al proposed a multi-start iterative tabu search algorithm (MS-ITS) to solve the MWVC problem [38]. In 2016, Li et al proposed a diversion local search procedure based on configuration checking (DLSWCC) to solve the problem and improve the results [19].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem

Wang

Punnen

2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

The minimum weight vertex cover problem (MWVCP) is a fundamental combinatorial optimization problem with various real-world applications. The MWVCP seeks a vertex cover of an undirected graph such that the sum of the weights of the selected vertices is as small as possible. In this paper, we present an effective algorithm to solve the MWVCP. First, a master-apprentice evolutionary algorithm based on two individuals is conducted to enhance the diversity of solutions. Second, a hybrid tabu search combined configuration checking and solution-based tabu search is introduced to intensify local search procedure. Harnessing the power of the evolutionary strategy and a novel variant of hybrid tabu search, Master-Apprentice Evolutionary Algorithm with Hybrid Tabu Search, MAE-HTS, is presented. Results of extensive computational experiments using standard benchmark instances and other large-scale instances demonstrate the efficacy of our algorithm in terms of solution quality, running time, and robustness compared to state-of-the-art heuristics from the literature and the commercial MIP solver Gurobi. We also systematically analyze the role of each individual component of the algorithm which when worked in unison produced superior outcomes. In particular, MAE-HTS produced improved solutions for 2 out of 126 public benchmark instances with better running time. In addition, our MAE-HTS outperforms other state-of-the-art algorithms DLSWCC and NuMWVC for 72 large scale MWVCP instances by obtaining the best results for 64 ones, while other two reference algorithms can only obtain 27 best results at most. INDEX TERMS Hybrid evolutionary algorithm, metaheuristics, minimum weight vertex cover problem, solution-based tabu search.

show abstract

Section: Introductionmentioning

confidence: 87%

Section: Algorithm 2 Framework Of the Graph Reductions For The Mwvcpmentioning

confidence: 99%

“…• MS-ITS by Zhou et al [38] • DLSWCC by Li et al [19] • NuMWVC by Li et al [18] and an ILP solver Gurobi 9.1.…”

Section: B Comparison With State-of-the-art Algorithmsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem

Wang

Punnen

2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…A similar work [8] used hybridized TS, and controlled simulated annealing [9]; in order to tackle the problem. The experiments carried out proved veracity of the work.…”

Section: Literature Reviewmentioning

confidence: 99%

The Applicability of Genetic algorithm to Vertex Cover

Bhasin¹,

Amini²

2015

IJCA

View full text Add to dashboard Cite

The Vertex Cover Problem calls for the selection of a set of vertices(V) in a way that all the edges of the graph, connected to those vertices constitute the set E of the given graph G= (V, E). The problem finds applications in various fields and is therefore, one of the most widely researched topics in NP Complete Problems. The problem is an NP Complete problem this work proposes a Genetic Algorithm based solution to handle the problem. The proposed algorithm has been implemented and tested for various graphs. These instances vary in the number of vertices and connectivity. The results are encouraging. This paper also explores the available techniques in order to put the things in the perspective. The future scope of this work intends to apply Diploid Genetic Algorithms to the problem to incorporate robustness into the proposed algorithm.

show abstract

Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem

Jovanović

Voß

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Multi-start iterated tabu search for the minimum weight vertex cover problem

Cited by 23 publications

References 19 publications

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem

The Applicability of Genetic algorithm to Vertex Cover

Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem

Contact Info

Product

Resources

About