REZZAG LEBZA, MOHAMED AYMEN2019-07-242019-07-242019https://repository.univ-msila.dz/handle/123456789/15882In 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.enminimum vertex cover problem, heuristics, meta-heuristics, bat algorithm, hybrid algorithmThesis