A NEW HYBRID GENETIC ALGORITHM FOR VERTEX COVER PROBLEM

Authors : Onur UĞURLU

Pages : 277-282

View : 14 | Download : 5

Publication Date : 2015-05-04

Article Type : Research Paper

Abstract :The minimum vertex cover  problem belongs to the  class  of  NP-compl ete  graph  theoretical problems. This paper presents a hybrid genetic algorithm to solve minimum ver tex cover problem. In this paper, it has been shown that when local optimization technique is added t o genetic algorithm to form hybrid genetic algorithm, it gives more quality solution than simple genet ic algorithm. Also, anew mutation operator has been developed especially for minimum vertex cover problem, whichc onverges faster to the global optimal solution. The new hybrid gentic algorith m has been compared with the previous works. The experimental results have shown that the propose d algorithm can yield quality solutions in reasonable times
Keywords : Tepe örtüsü problemi, Hibrid algoritmalar, Genetik algoritmalar, Yerel optimizasyon teknikleri