Skip to main content
SpringerLink
Log in

A Hybrid Evolutionary Algorithm with Taboo and Competition Strategies for Minimum Vertex Cover Problem

  • Conference paper
  • First Online:
Neural Information Processing (ICONIP 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1142))

Included in the following conference series:

Abstract

The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial optimization problem, which is of great significance in both theory and application. Evolutionary algorithms and local search algorithms have proved to be two important methods to solve this problem. However, the combination of these two methods does not perform well. In order to acquire an effective hybrid evolutionary algorithm, two new control strategies are proposed, which are taboo of solution-distance and intensive competition of individuals. A hybrid evolutionary algorithm for the MVC problem, referred to HETC, is proposed in this paper using these two strategies. The effectiveness of the proposed scheme is validated by conducting deep simulations. The results obtained by the proposed scheme are compared with results obtained by EWSL, the state-of-the-art algorithm, and NuMVC.

J. Xu—This work was supported by the Beijing Natural Science Foundation (No. 4192029), and the National Natural Science Foundation of China (61773385, 61672523). We gratefully acknowledge the support of NVIDIA Corporation with the donation of the Titan Xp used for this research.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baluja, S.: Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical report CMU-CS-94-163, Computer Science Department, Pittsburgh, PA (1994)

    Google Scholar 

  2. Bauer, M., Golinelli, O.: Core percolation in random graphs: a critical phenomena analysis. Eur. Phys. J. B 24, 339 (2001)

    Article  Google Scholar 

  3. Bollob, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)

    Book  Google Scholar 

  4. Bonet, J.S.D., Isbell, Jr, C.L., Viola, P.: 1996. MIMIC: finding optima by estimating probability densities. In: Advances in Neural Information Processing Systems, vol. 424. The MIT Press (1997)

    Google Scholar 

  5. Cai, S., Su, K., Luo, C., Sattar, A.: NuMVC: an efficient local search algorithm for minimum vertex cover. J. Artif. Int. Res. 46(1), 687–716 (2013)

    MathSciNet  MATH  Google Scholar 

  6. Cai, S., Su, K., Chen, Q.: EWLS: a new local search for minimum vertex cover. In: AAAI Conference on Artificial Intelligence (2010)

    Google Scholar 

  7. Chickering, D., Heckerman, D., Meek, C.: A Bayesian approach to learning Bayesian networks with local structure. Technical report MSR-TR-97-07, Microsoft Research, Redmond, WA (1997)

    Google Scholar 

  8. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162(1), 439–485 (2005)

    Article  MathSciNet  Google Scholar 

  9. He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3(1), 21–35 (2004)

    Article  MathSciNet  Google Scholar 

  10. Karloff, H.: Linear Programming. Birkhauser, Boston (1991)

    Book  Google Scholar 

  11. Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J., Bohlinger, J. (eds.) The IBM Research Symposia Series. Complexity of Computer Computations, pp. 85–103. Springer, US (1972). https://doi.org/10.1007/978-1-4684-2001-2_9

    Chapter  Google Scholar 

  12. Larraanaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Norwell (2001)

    Google Scholar 

  13. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498–516 (1973)

    Article  MathSciNet  Google Scholar 

  14. Mckee, T., Mcmorris, F.: Topics in intersection graph theory. SIAM, Philadelphia (1999)

    Book  Google Scholar 

  15. Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Progam. 8, 232–248 (1975)

    Article  MathSciNet  Google Scholar 

  16. Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425–440 (1991)

    Article  MathSciNet  Google Scholar 

  17. Rosin, C.D.: Unweighted stochastic local search can be effective for random CSP benchmarks. CoRR abs/1411.7480 (2014)

    Google Scholar 

  18. Zhang, Q., Sun, J., Tsang, E.: An evolutionary algorithm with guided mutation for the maximum clique problem. Trans. Evol. Comp 9(2), 192–200 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Lab of Data Engineering and Knowledge Engineering, Renmin University of China, Beijing, China

    Gang Yang, Daopeng Wang & Jieping Xu

Authors
  1. Gang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daopeng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jieping Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jieping Xu .

Editor information

Editors and Affiliations

  1. Australian National University, Canberra, ACT, Australia

    Tom Gedeon

  2. Murdoch University, Murdoch, WA, Australia

    Kok Wai Wong

  3. Kyungpook National University, Daegu, Korea (Republic of)

    Minho Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yang, G., Wang, D., Xu, J. (2019). A Hybrid Evolutionary Algorithm with Taboo and Competition Strategies for Minimum Vertex Cover Problem. In: Gedeon, T., Wong, K., Lee, M. (eds) Neural Information Processing. ICONIP 2019. Communications in Computer and Information Science, vol 1142. Springer, Cham. https://doi.org/10.1007/978-3-030-36808-1_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-36808-1_79

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-36807-4

  • Online ISBN: 978-3-030-36808-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation