An Efficient Local Search for the Feedback Vertex Set Problem

Algorithms

Zhiqiang Zhang¹  Ansheng Ye¹  Xiaoqing Zhou¹ 

[1] Key Laboratory of Pattern Recognition and Intelligent Information Processing, Shiling, Institutions of Higher Education of Sichuan Province, Chengdu 610106, China; E-Mails:

关键词: feedback vertex set;    local search;    variable depth search;    heuristic;   

DOI  :  10.3390/a6040726

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2013 by the authors; licensee MDPI, Basel, Switzerland.