Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Set Problem consists of finding the subset F â V of vertices, with minimum weight, whose removal results in an acyclic graph. Finding the minimum feedback vertex set in a graph is an important combinatorial problem that has a variety of real applications. In this article, we introduce a memetic algorithm for this problem. We propose an efficient greedy procedure that quickly generates chromosomes with specific characteristics and a wise application of recent local search procedures based on Îº -diamonds. Computational results show that the proposed algorithm outperforms the effectiveness of two other metaheuristics recently proposed in the literature for this problem.
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1002/net.21577|
|Codice identificativo ISI:||WOS:000346701500008|
|Codice identificativo Scopus:||2-s2.0-84919394396|
|Titolo:||A memetic algorithm for the weighted feedback vertex set problem|
|Appare nelle tipologie:||1.1 Articolo in rivista|