Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Balachandar SR, Kannan K (2009) A meta-heuristic algorithm for vertex covering problem based on gravity. Int J Math Stat Sci 1(3):130–136

    Google Scholar 

  • Bouamama S, Blum C, Boukerram A (2012) A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl Soft Comput 12(6):1632–1639

    Article  Google Scholar 

  • Chen J, Kanj IA, Xia G (2006) Improved parameterized upper bounds for vertex cover. Math Found Comput Sci 2006:238–249

    MathSciNet  MATH  Google Scholar 

  • Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233–235

    Article  MathSciNet  MATH  Google Scholar 

  • El Ouali M, Fohlin H, Srivastav A (2014) An approximation algorithm for the partial vertex cover problem in hypergraphs. J Comb Optim 28:1–19

    Article  MathSciNet  MATH  Google Scholar 

  • Fu Z, Huang W, Lü Z (2013) Iterated tabu search for the circular open dimension problem. Eur J Oper Res 225(2):236–243

    Article  MathSciNet  MATH  Google Scholar 

  • Glover F (1989) Tabu search-part i. ORSA J Comput 1(3):190–206

    Article  MATH  Google Scholar 

  • Huang W, Fu Z, Xu R (2013) Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container. Sci China Info Sci 56(9):1–14

    Article  Google Scholar 

  • Jovanovic R, Tuba M (2011) An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl Soft Comput 11(8):5360–5366

    Article  Google Scholar 

  • Karp RM, Miller RE, Theater JW (1972) Complexity of computer computations. Plenum Press, New York

    Google Scholar 

  • Lü Z, Hao JK (2010) Adaptive tabu search for course timetabling. Eur J Oper Res 200(1):235–244

    Article  MATH  Google Scholar 

  • Lü Z, Huang W (2009) Iterated tabu search for identifying community structure in complex networks. Phys Rev E 80(2):026130

    Article  Google Scholar 

  • Malek M, Guruswamy M, Pandya M, Owens H (1989) Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Ann Oper Res 21(1):59–84

    Article  MathSciNet  MATH  Google Scholar 

  • Niedermeier R, Rossmanith P (2003) On efficient fixed-parameter algorithms for weighted vertex cover. J Algorithms 47(2):63–77

    Article  MathSciNet  MATH  Google Scholar 

  • Peng B, Lü Z, Cheng T (2015) A tabu search/path relinking algorithm to solve the job shop scheduling problem. Computers Oper Res 53:154–164

    Article  MathSciNet  Google Scholar 

  • Shyu SJ, Yin PY, Lin BM (2004) An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann Oper Res 131(1–4):283–304

    Article  MathSciNet  MATH  Google Scholar 

  • Singh A, Gupta AK (2006) A hybrid heuristic for the minimum weight vertex cover problem. Asia Pac J Oper Res 23(02):273–285

    Article  MathSciNet  MATH  Google Scholar 

  • Voß S, Fink A (2012) A hybridized tabu search approach for the minimum weight vertex cover problem. J Heuristics 18(6):869–876

    Article  Google Scholar 

  • Zhang W, Wu W, Lee W, Du DZ (2012) Complexity and approximation of the connected set-cover problem. J Glob Optim 53(3):563–572

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang Z, Wu W, Fan L, Du DZ (2013) Minimum vertex cover in ball graphs through local search. J Glob Optim 59:1–9

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This paper is dedicated to memorizing the authors’ mentor Prof. Wenqi Huang for his lifelong instruction. We thank the anonymous referee for the helpful comments to improve our paper significantly. Special thanks are given to Tao Qin and Hongyun Xu for partially implementing the code and refining the paper. The research was partially supported by the National Natural Science Foundation of China (Grant Nos. 61370183, 61100144), and the program for New Century Excellent Talents in University (NCET 2013).

Author information

Authors and Affiliations

  1. Smart, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, 430074, People’s Republic of China

    Taoqing Zhou, Zhipeng Lü, Yang Wang, Junwen Ding & Bo Peng

Authors
  1. Taoqing Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhipeng Lü
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Junwen Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bo Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bo Peng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, T., Lü, Z., Wang, Y. et al. Multi-start iterated tabu search for the minimum weight vertex cover problem. J Comb Optim 32, 368–384 (2016). https://doi.org/10.1007/s10878-015-9909-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9909-3

Keywords

Search

Navigation