Ant colony optimization applied to minimum weight dominating set problem

Raka Jovanovic, Milan Tuba, Dana Simian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 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 - 1 Dec 2010
Event12th WSEAS International Conference on Automatic Control, Modelling and Simulation, ACMOS '10 - Catania, Italy
Duration: 29 May 201031 May 2010

Other

Other12th WSEAS International Conference on Automatic Control, Modelling and Simulation, ACMOS '10
CountryItaly
CityCatania
Period29/5/1031/5/10

    Fingerprint

Keywords

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

ASJC Scopus subject areas

  • Modelling and Simulation

Cite this

Jovanovic, R., Tuba, M., & Simian, D. (2010). Ant colony optimization applied to minimum weight dominating set problem. In 12th WSEAS International Conference on Automatic Control, Modelling and Simulation, ACMOS '10 (pp. 322-326)