Ant Colony Algorithms for Steiner Trees

Abstract

This chapter introduces ant colony optimization as a method for computing minimum Steiner trees in graphs. Tree computation is achieved when multiple ants, starting out from different nodes in the graph, move towards one another and ultimately merge into a single entity. A distributed version of the proposed algorithm is also described, which is applied to the specific problem of data-centric routing in wireless sensor networks. This research illustrates how tree based graph theoretic computations can be accomplished by means of purely local ant interaction. The authors hope that this work will demonstrate how innovative ways to carry out ant interactions can be used to design effective ant colony algorithms for complex optimization problems.