An ant colony optimization algorithm for solving Group Steiner Problem

Group Steiner Problem (GSP) is an important generalization of some basic NP-hard problems. Many complex real-world applications require solving the GSP in graphs modeling the topology of the given problem, such as: the design of Very Large Scale Integration (VLSI) circuits, the design of a minimal length irrigation network, and routing problems for wireless sensor networks. We show our design of a new algorithm based on an Ant Colony Optimization model to solve the GSP in general graphs. Our experimental results show that our method strongly outperforms the best other heuristic methods for GSP.