Ant System for the k-Cardinality Tree Problem

This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on pheromone with a weight based greedy local optimization. Experimental results on a large set of problem instances show that this algorithm matches or surpasses other algorithms including an ant colony optimization algorithm, a tabu search algorithm, an evolutionary algorithm and a greedy-based algorithm on all but one of the 138 tested instances.

• Type: Conference
• Year: 2004
• Where: GECCO
• Authors: Thang Nguyen Bui, Gnanasekaran Sundarraj
• Keywords: Algorithm, Evolutionary Algorithm, GECCO 2004, Search Algorithm