Solving Minimum Steiner Tree based on behavior of ants

This paper elaborates a new method for solving the Minimum Steiner Tree in an undirected graph. This method is based on behavior of real ants and solves the problem in lesser time to generate the Minimal Steiner tree. The general concept of finding minimum path develops from the deviation of the ants´ path which is influenced by other ant colonies or the paths created by ants of other colonies when they move from one colony to another and thus as a result forming the Steiner tree. The path so formed is considered to be the minimum distance path between all the colonies involved.