Meta-heuristic based approach for Minimum Vertex Cover Problem
Loading...
Date
2019
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
UNIVERSITE MOHAMED BOUDIAF - M’SILA FACULTE DES MATHEMATIQUES ET DE L’INFORMATIQUE DEPARTEMENT D’INFORMATIQUE- Option: IDO
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.
Description
Keywords
minimum vertex cover problem, heuristics, meta-heuristics, bat algorithm, hybrid algorithm