Ant colony optimization applied to minimum weight dominating set problem

Raka Jovanovic*, Milan Tuba, Dana Simian

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

44 Citations (Scopus)

Abstract

In this paper we present an application of ant colony optimization (ACO) to the Minimum Weighted Dominating Set Problem. We introduce a heuristic for this problem that takes into account the weights of vertexes being covered and show that it is more efficient than the greedy algorithm using the standard heuristic. Further we give implementation details of ACO applied to this problem. We tested our algorithm on graphs with different sizes, edge densities, and weight distribution functions and shown that it gives greatly improved results over these acquired by the greedy algorithms.

Original languageEnglish
Title of host publication12th WSEAS International Conference on Automatic Control, Modelling and Simulation, ACMOS '10
Pages322-326
Number of pages5
Publication statusPublished - 2010
Externally publishedYes
Event12th WSEAS International Conference on Automatic Control, Modelling and Simulation, ACMOS '10 - Catania, Italy
Duration: 29 May 201031 May 2010

Publication series

Name12th WSEAS International Conference on Automatic Control, Modelling and Simulation, ACMOS '10

Conference

Conference12th WSEAS International Conference on Automatic Control, Modelling and Simulation, ACMOS '10
Country/TerritoryItaly
CityCatania
Period29/05/1031/05/10

Keywords

  • Ant colony optimization
  • Dominating set problem
  • Optimization problems
  • Population based algorithms

Fingerprint

Dive into the research topics of 'Ant colony optimization applied to minimum weight dominating set problem'. Together they form a unique fingerprint.

Cite this