Presenting a New Method to Solve QoS Multicast Routing Based on Harmony Search Algorithm

The multicast routing problem by regarding the criterions quality of service is included as a nonlinear combinational optimization problem, and its goal is finding a least cost multicast routing tree, while reaching quality of service constraints, such as delay, bandwidth and etc. One of the most popular methods for solving this problem is finding the constrained Steiner tree in a network. Finding such tree in the network is one of NP-Complete problems. For this reason, many approximation methods using Meta-heuristic algorithms have been reported for solving it. In this paper we present a novel method based on harmony search algorithm which can create the optimized routing tree with a proper speed. The result of performed simulations show that the proposed algorithm donʹt be caught in local optimal and compared with genetic algorithm, particle swarm optimization algorithm and bees algorithm, has a proper performance, regarding to convergence time and the quality of generated solutions.