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 combinato- rial problem that has a variety of real applications. In this paper 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 a recent local search procedures based on k-diamonds. Computa- tional results show that the proposed algorithm outperforms the effectiveness of two other metaheuristics recently proposed in the literature for this problem.