Ant system for the k-cardinality tree problem

Thang N. Bui, Gnanasekaran Sundarraj

Research output: Chapter in Book/Report/Conference proceedingChapter

9 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsKalyanmoy Deb, Riccardo Poli, Owen Holland, Kalyanmoy Banzhaf, Hans-Georg Beyer, Edmund Burke, Paul Darwen, Dipankar Dasgupta, Dario Floreano, James Foster, Mark Harman, Pier Luca Lanzi, Lee Spector, Andrea G. B. Tettamanzi, Dirk Thierens, Andrew M. Tyrrell
PublisherSpringer Verlag
Pages36-47
Number of pages12
ISBN (Print)3540223444, 9783540223443
DOIs
StatePublished - Jan 1 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3102
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Ant system for the k-cardinality tree problem'. Together they form a unique fingerprint.

Cite this