Cinaroglu, SinemBodur, Sema2024-02-232024-02-232018978-1-5386-5150-6https://hdl.handle.net/20.500.12452/17436IEEE (SMC) International Conference on Innovations in Intelligent Systems and Applications (INISTA) -- JUL 03-05, 2018 -- Thessaloniki, GREECEMinimum vertex cover (MVC) problem is a NP Hard optimization problem which we often encounter in real life applications like wireless sensor networks, graph theory, bioinformatics, social network analysis etc. To deal with this optimization problem in an efficient way, we introduce a new Hybrid Genetic algorithm (NHGA) to solve MVC problem. In this study, the proposed algorithm has also been tested on DIMACS benchmarks, BHOSLIB benchmarks and random graphs. Performance of NHGA is then compared with the simple Genetic algorithm (GA) and Clever Greedy algorithm. Consequently, experimental results show that NHGA finds better solutions than other algorithms for MVC, since it offers near to optimal solutions.eninfo:eu-repo/semantics/closedAccessMinimum Vertex CoverGenetic AlgorithmClever Greedy AlgorithmHybrid Genetic AlgorithmConference Object2-s2.0-85055489987WOS:000455620700041