An analysis of different variations of ant colony optimization to the minimum weight vertex cover problem

Milan Tuba, Raka Jovanovic

Research output: Contribution to journalArticle

16 Citations (Scopus)


Ant colony optimization (ACO) has previously been applied to the Minimum Weight Vertex Cover Problem with very good results. The performance of the ACO algorithm can be improved with the use of different variations of the basic Ant Colony System algorithm, like the use of Elitism, Rank based approach and the MinMax system. In this paper, we have made an analysis of effectiveness of these variations applied to the Minimum Weight Vertex Covering Problem for different problem cases. This analysis is done by the observation of several properties of acquired solutions by these algorithms like best found solution, average solution quality, dispersion and distribution of solutions.

Original languageEnglish
Pages (from-to)936-945
Number of pages10
JournalWSEAS Transactions on Information Science and Applications
Issue number6
Publication statusPublished - 6 Aug 2009
Externally publishedYes



  • Ant colony
  • Minimum weight vertex cover
  • Optimization problems
  • Population based algorithms

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications

Cite this