An Efficient Local Search for the Feedback Vertex Set Problem

Author： Zhang Zhiqiang Ye Ansheng Zhou Xiaoqing Shao Zehui

Publisher： MDPI

E-ISSN： 1999-4893|6|4|726-746

ISSN： 1999-4893

Source： Algorithms, Vol.6, Iss.4, 2013-11, pp. : 726-746

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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.