An artificial bee colony algorithm for minimum weight dominating set

The minimum weight dominating set (MWDS) problem is a classic NP-Hard optimisation problem with a wide range of practical applications. As a result, many algorithms have been proposed for this problem. Several greedy and approximation algorithms exist which provide good results for unit disk graphs with smooth weights. However, these algorithms do not perform well when applied to general graphs. There are a few metaheuristics in the literature such as genetic algorithms and ant colony optimisation algorithm, which also work for general graphs. In this paper, a swarm intelligence algorithm called artificial bee colony (ABC) algorithm is presented for the MWDS problem. The proposed ABC algorithm is compared with other metaheuristics in the literature and shown to perform better than any of these metaheuristics, both in terms of solution quality and time taken.