UniSa - IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishGiven 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.
| Titolo: | A Memetic Algorithm for the Weighted Feedback Vertex Set Problem |
| Autori: | |
| Data di pubblicazione: | 2014 |
| Rivista: | |
| Abstract: | 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. |
| Handle: | http://hdl.handle.net/11386/4276653 |
| Appare nelle tipologie: | 1.1.2 Articolo su rivista con ISSN |
File in questo prodotto:
http://hdl.handle.net/11386/4276653
Copyright © 2021