Meta-heuristic based approach for Minimum Vertex Cover Problem

Abstract

In this study, we deal with one of the fundamental problems in graph theory and combinatorial optimization, that is, the minimum vertex cover problem (MVCP). We make a comparison between well-known heuristic: genetic algorithm and new metaheuristic: bat algorithm. Also, a hybrid algorithm is proposed to obtain much more optimal result. A comparison is applied to decides which of these three algorithms is much butter to find the optimal solution to the minimum vertex cover problem.