A Hybrid Immunological Search for the Weighted Feedback Vertex Set Problem

In this paper we present a hybrid immunological inspired algorithm (Hybrid-IA) for solving the Minimum Weighted Feedback Vertex Set (M W F V S) problem. MWFVS is one of the most interesting and challenging combinatorial optimization problem, which finds application in many fields and in many real life tasks. The proposed algorithm is inspired by the clonal selection principle, and therefore it takes advantage of the main strength characteristics of the operators of (i) cloning; (ii) hypermutation; and (iii) aging. Along with these operators, the algorithm uses a local search procedure, based on a deterministic approach, whose purpose is to refine the solutions found so far. In order to evaluate the efficiency and robustness of Hybrid-IA several experiments were performed on different instances, and for each instance it was compared to three different algorithms: (1) a memetic algorithm based on a genetic algorithm (MA); (2) a tabu search metaheuristic (XTS); and (3) an iterative tabu search (ITS). The obtained results prove the efficiency and reliability of hybrid-IA on all instances in term of the best solutions found and also similar performances with all compared algorithms, which represent nowadays the state-of-the-art on for MWFVS problem.

[1]  Mihalis Yannakakis,et al.  Node-Deletion Problems on Bipartite Graphs , 1981, SIAM J. Comput..

[2]  Mario Pavone,et al.  DENSA: An effective negative selection algorithm with flexible boundaries for self-space and dynamic number of detectors , 2017, Eng. Appl. Artif. Intell..

[3]  Vincenzo Cutello,et al.  Packing equal disks in a unit square: an immunological optimization approach , 2015, 2015 International Workshop on Artificial Immune Systems (AIS).

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[5]  Yuling Tian,et al.  Research on B Cell Algorithm for Learning to Rank Method Based on Parallel Strategy , 2016, PloS one.

[6]  Vincenzo Cutello,et al.  The Influence of Age Assignments on the Performance of Immune Algorithms , 2018, UKCI.

[7]  Giuseppe Nicosia,et al.  Clonal selection: an immunological algorithm for global optimization over continuous spaces , 2012, J. Glob. Optim..

[8]  Francesco Maffioli,et al.  Solving the feedback vertex set problem on undirected graphs , 2000, Discret. Appl. Math..

[9]  Vincenzo Cutello,et al.  How long should offspring lifespan be in order to obtain a proper exploration? , 2016, 2016 IEEE Symposium Series on Computational Intelligence (SSCI).

[10]  Yuren Zhou,et al.  On the effectiveness of immune inspired mutation operators in some discrete optimization problems , 2018, Inf. Sci..

[11]  Raffaele Cerulli,et al.  A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem , 2011, INOC.

[12]  Mauro Dell'Amico,et al.  Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method , 1999, J. Heuristics.

[13]  Thomas Jansen,et al.  Computing Longest Common Subsequences with the B-Cell Algorithm , 2012, ICARIS.

[14]  Vincenzo Cutello,et al.  An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem , 2007, J. Comb. Optim..

[15]  Raffaele Cerulli,et al.  A memetic algorithm for the weighted feedback vertex set problem , 2014, Networks.

[16]  Dan Gusfield,et al.  A Graph Theoretic Approach to Statistical Data Security , 1988, SIAM J. Comput..

[17]  David Peleg,et al.  Size Bounds for Dynamic Monopolies , 1998, Discret. Appl. Math..

[18]  Christine Zarges,et al.  On the utility of the population size for inversely fitness proportional mutation rates , 2009, FOGA '09.

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

[20]  Vincenzo Cutello,et al.  Protein multiple sequence alignment by hybrid bio-inspired algorithms , 2011, Nucleic acids research.

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

[22]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[23]  Thomas Jansen,et al.  On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem , 2011, ICARIS.

[24]  Vincenzo Cutello,et al.  An Immune Algorithm for Protein Structure Prediction on Lattice Models , 2007, IEEE Transactions on Evolutionary Computation.

[25]  SoffaMary Lou,et al.  Feedback vertex sets and cyclically reducible graphs , 1985 .

[26]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .