A NEW HYBRID GENETIC ALGORITHM FOR VERTEX COVER PROBLEM

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Anadolu Üniversitesi Bilim Ve Teknoloji Dergisi A - Uygulamalı Bilimler Mühendislik
Volume:14 Issue:3 Special Issue
A NEW HYBRID GENETIC ALGORITHM FOR VERTEX COVER PROBLEM

A NEW HYBRID GENETIC ALGORITHM FOR VERTEX COVER PROBLEM

Authors : Onur UĞURLU

Pages : 277-282

View : 18 | Download : 7

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

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.