Ant system for the k-cardinality tree problem

Thang N. Bui, Gnanasekaran Sundarraj

Research output: Contribution to journalArticle

9 Citations (Scopus)

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)
Pages (from-to)36-47
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3102
StatePublished - Dec 1 2004

Fingerprint

Ants
Cardinality
K-tree
Tabu Search Algorithm
Local Optimization
Pheromone
Weighted Graph
Tabu search
Ant colony optimization
Large Set
Pheromones
Optimization Techniques
Evolutionary Algorithms
Taboo
Optimization Algorithm
Weights and Measures
Evolutionary algorithms
Experimental Results

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{021253205aac4720b49befd3142dbf4e,
title = "Ant system for the k-cardinality tree problem",
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.",
author = "Bui, {Thang N.} and Gnanasekaran Sundarraj",
year = "2004",
month = "12",
day = "1",
language = "English (US)",
volume = "3102",
pages = "36--47",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Ant system for the k-cardinality tree problem

AU - Bui, Thang N.

AU - Sundarraj, Gnanasekaran

PY - 2004/12/1

Y1 - 2004/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33750279119&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750279119&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33750279119

VL - 3102

SP - 36

EP - 47

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -