Academic Journals Database
Disseminating quality controlled scientific knowledge

An Efficient Local Search for the Feedback Vertex Set Problem

ADD TO MY LIST
 
Author(s): Zhiqiang Zhang | Ansheng Ye | Xiaoqing Zhou | Zehui Shao

Journal: Algorithms
ISSN 1999-4893

Volume: 6;
Issue: 4;
Start page: 726;
Date: 2013;
Original page

Keywords: feedback vertex set | local search | variable depth search | heuristic

ABSTRACT
Inspired by many deadlock detection applications, the feedback vertex set is defined as a set of vertices in an undirected graph, whose removal would result in a graph without cycle. The Feedback Vertex Set Problem, known to be NP-complete, is to search for a feedback vertex set with the minimal cardinality to benefit the deadlock recovery. To address the issue, this paper presents NewkLS FVS(LS, local search; FVS, feedback vertex set), a variable depth-based local search algorithm with a randomized scheme to optimize the efficiency and performance. Experimental simulations are conducted to compare the algorithm with recent metaheuristics, and the computational results show that the proposed algorithm can outperform the other state-of-art algorithms and generate satisfactory solutions for most DIMACSbenchmarks.

Tango Jona
Tangokurs Rapperswil-Jona

    
RPA Switzerland

Robotic Process Automation Switzerland