Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Spanning Trees---Short or Small
SIAM Journal on Discrete Mathematics
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Ant algorithms for discrete optimization
Artificial Life
Future Generation Computer Systems
Tabu Search
Introduction to Algorithms
Decomposing Matrices into Blocks
SIAM Journal on Optimization
Ant Colony Optimization For The Edge-weighted k-cardinality Tree Problem
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Local search algorithms for the k-cardinality tree problem
Discrete Applied Mathematics
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A new hybrid evolutionary algorithm for the huge k-cardinality tree problem
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Computational Optimization and Applications
Computers and Industrial Engineering
LS(graph & tree): a local search framework for constraint optimization on graphs and trees
Proceedings of the 2009 ACM symposium on Applied Computing
Obtaining optimal k-cardinality trees fast
Journal of Experimental Algorithmics (JEA)
MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
An ant colony optimization approach for the multidimensional knapsack problem
Journal of Heuristics
Face mis-alignment analysis by multiple-instance subspace
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation
Discrete Applied Mathematics
Proceedings of the 2010 Symposium on Information and Communication Technology
An approximate solution method based on tabu search for k-minimum spanning tree problems
International Journal of Knowledge Engineering and Soft Data Paradigms
Reconstructing geometrically consistent tree structures from noisy images
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part I
Expert Systems with Applications: An International Journal
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Hi-index | 0.01 |
In this paper we propose three metaheuristic approaches, namely a Tabu Search, an Evolutionary Computation and an Ant Colony Optimization approach, for the edge-weighted k-cardinality tree (KCT) problem. This problem is an NP-hard combinatorial optimization problem that generalizes the well-known minimum weight spanning tree problem. Given an edge-weighted graph G = (V,E), it consists of finding a tree in G with exactly k ≤ |V| - 1 edges, such that the sum of the weights is minimal. First, we show that our new metaheuristic approaches are competitive by applying them to a set of existing benchmark instances and comparing the results to two different Tabu Search methods from the literature. The results show that these benchmark instances are not challenging enough for our metaheuristics. Therefore, we propose a diverse set of benchmark instances that are characterized by different features such as density and variance in vertex degree. We show that the performance of our metaheuristics depends on the characteristics of the tackled instance, as well as on the cardinality. For example, for low cardinalities the Ant Colony Optimization approach is best, whereas for high cardinalities the Tabu Search approach has advantages.