Targeting the Minimum Vertex Set Problem with an Enhanced Genetic Algorithm Improved with Local Search Strategies

The minimum feedback vertex set in a directed graph is a NP-hard problem i.e., it is very unlikely that a polynomial algorithm can be found to solve any instances of it. Solutions of the minimum feedback vertex set can find several real world applications. For this reason, it is useful to investigate heuristics that might give near-optimal solutions. Here we present an enhanced genetic algorithm with an ad hoc local search improvement strategy that finds good solutions for any given instance. To prove the effectiveness of the algorithm, we provide an implementation tested against a large variety of test cases. The results we obtain are compared to the results obtained by greedy and randomized algorithms for finding approximate solutions to the problem.

[1]  Ewald Speckenmeyer,et al.  On Feedback Problems in Diagraphs , 1989, WG.

[2]  Jing-Yang Jou,et al.  Computing minimum feedback vertex sets by contraction operations and its applications on CAD , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[3]  Panos M. Pardalos,et al.  Feedback Set Problems , 1999, Handbook of Combinatorial Optimization.

[4]  S. Salzberg,et al.  Hierarchical scaffolding with Bambus. , 2003, Genome research.

[5]  Panos M. Pardalos,et al.  Handbook of combinatorial optimization. Supplement , 2005 .

[6]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[7]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[8]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[9]  Jing-Yang Jou,et al.  On computing the minimum feedback vertex set of a directed graph bycontraction operations , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[11]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[12]  Paul S. Bonsma,et al.  Feedback Vertex Set in Mixed Graphs , 2010, WADS.

[13]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[14]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem , 1998, J. Comb. Optim..

[15]  Toshimasa Watanabe,et al.  Performance comparison of approximation algorithms for the minimum weight vertex cover problem , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[16]  Paul D. Seymour,et al.  Packing directed circuits fractionally , 1995, Comb..

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Francesco Pappalardo,et al.  Using Viruses to Improve GAs , 2005, ICNC.

[19]  Reuven Bar-Yehuda,et al.  Randomized Algorithms for the Loop Cutset Problem , 2000, J. Artif. Intell. Res..

[20]  Mary Lou Soffa,et al.  Feedback vertex sets and cyclically reducible graphs , 1985, JACM.

[21]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[22]  Xiaotie Deng,et al.  An Approximation Algorithm for Feedback Vertex Sets in Tournaments , 2001, SIAM J. Comput..

[23]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[24]  Dan Geiger,et al.  Optimization of Pearl's Method of Conditioning and Greedy-Like Approximation Algorithms for the Vertex Feedback Set Problem , 1996, Artif. Intell..

[25]  Adi Shamir,et al.  A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs , 1979, SIAM J. Comput..

[26]  Claudio Altafini,et al.  Decompositions of large-scale biological systems based on dynamical properties , 2012, Bioinform..