An algorithm based on ant colony optimization for the minimum connected dominating set problem

2019 ◽  
Vol 80 ◽  
pp. 672-686 ◽  
Author(s):  
Salim Bouamama ◽  
Christian Blum ◽  
Jean-Guillaume Fages
Keyword(s):  
Ant Colony Optimization ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Ant Colony ◽  
Minimum Connected Dominating Set ◽  
Dominating Set Problem

scholarly journals Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem

2013 ◽  
Vol 10 (1) ◽  
pp. 133-149 ◽  
Author(s):  
Raka Jovanovic ◽  
Milan Tuba
Keyword(s):  
Ant Colony Optimization ◽  
Ad Hoc ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Local Optima ◽  
Minimum Connected Dominating Set ◽  
Negative Effect ◽  
Dominating Set Problem

In this paper an ant colony optimization (ACO) algorithm for the minimum connected dominating set problem (MCDSP) is presented. The MCDSP become increasingly important in recent years due to its applicability to the mobile ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO algorithm based on a known simple greedy algorithm that has a significant drawback of being easily trapped in local optima. We have shown that by adding a pheromone correction strategy and dedicating special attention to the initial condition of the ACO algorithm this negative effect can be avoided. Using this approach it is possible to achieve good results without using the complex two-step ACO algorithm previously developed. We have tested our method on standard benchmark data and shown that it is competitive to the existing algorithms.

Sign in / Sign up

Export Citation Format

Share Document