A new hybrid evolutionary algorithm for the huge k-cardinality tree problem

In recent years it has been shown that an intelligent combination of metaheuristics with other optimization techniques can significantly improve over the application of a pure metaheuristic. In this paper, we combine the evolutionary computation paradigm with dynamic programming for the application to the NP-hard k-cardinality tree problem. Given an undirected graph G with node and edge weights, this problem consists of finding a tree in G with exactly k edges such that the sum of the weights is minimal. The genetic operators of our algorithm are based on an existing dynamic programming algorithm from the literature for finding optimal subtrees in a given tree. The simulation results show that our algorithm is able to improve the best known results for benchmark problems from the literature in 60 cases.

[1]  Horst W. Hamacher,et al.  Integer programming approaches tofacilities layout models with forbidden areas , 1998, Ann. Oper. Res..

[2]  Dorit S. Hochbaum,et al.  An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane , 1994, STOC '94.

[3]  Christian Blum,et al.  New metaheuristic approaches for the edge-weighted k-cardinality tree problem , 2005, Comput. Oper. Res..

[4]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[5]  Akhil Kumar,et al.  Efficient quorumcast routing algorithms , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[6]  Günther R. Raidl,et al.  Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.

[7]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[8]  R. Ravi,et al.  Spanning trees short or small , 1994, SODA '94.

[9]  Gnanasekaran Sundarraj,et al.  Ant System for the k-Cardinality Tree Problem , 2004, GECCO.

[10]  Horst W. Hamacher,et al.  Integer programming approaches tofacilities layout models with forbidden areas , 1998 .

[11]  M. Ehrgott,et al.  Heuristics for the K-Cardinality Tree and Subgraph Problems , 1996 .

[12]  M. Fischetti,et al.  Weighted k-cardinality trees , 1992 .

[13]  Jack Brimberg,et al.  Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem , 2004, Comput. Oper. Res..

[14]  Matthias Ehrgott,et al.  OR software - ORSEP operations research software exchange program Edited by Professor H.W. Hamacher K_TREE/K_SUBGRAPH: A program package for minimal weighted K-cardinality trees and subgraphs , 1996 .

[15]  Christian Blum,et al.  Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem , 2005, IWANN.

[16]  Matteo Fischetti,et al.  Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.

[17]  David B. Fogel,et al.  Evolutionary algorithms in theory and practice , 1997, Complex.

[18]  Christian Blum,et al.  Local Search Algorithms for the k-cardinality Tree Problem , 2003, Discret. Appl. Math..

[19]  Ryuhei Uehara,et al.  The Number of Connected Components in Graphs and Its Applications , 2007 .

[20]  Alain Hertz,et al.  A framework for the description of evolutionary algorithms , 2000, Eur. J. Oper. Res..

[21]  Christian Blum,et al.  Revisiting dynamic programming for finding optimal subtrees in trees , 2007, Eur. J. Oper. Res..

[22]  Carlos Eduardo Ferreira,et al.  Decomposing Matrices into Blocks , 1998, SIAM J. Optim..

[23]  Carlos Eduardo Ferreira,et al.  Matrix Decomposition by Branch-and-Cut , 1997 .