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

Taoqing Zhou, Zhipeng Lü (), Yang Wang, Junwen Ding and Bo Peng ()
Additional contact information
Taoqing Zhou: Huazhong University of Science and Technology
Zhipeng Lü: Huazhong University of Science and Technology
Yang Wang: Huazhong University of Science and Technology
Junwen Ding: Huazhong University of Science and Technology
Bo Peng: Huazhong University of Science and Technology

Journal of Combinatorial Optimization, 2016, vol. 32, issue 2, No 4, 368-384

Abstract: Abstract 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.

Keywords: Minimum weight vertex cover problem; Tabu search; Fast evaluation strategy; Perturbation; Meta-heuristic (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9909-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-015-9909-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9909-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().