Steiner tree heuristic algorithm based on weight

The minimum Steiner tree problem, a classical combinatorial optimization problem with a long history, is a NP-complete problem. Due to its wide application, study of heuristic algorithm about Steiner tree problem has important practical and theoretical significance. In this paper, based on the MPH algorithm, give non-multicast nodes weights and calculate their average weight for the path through non-multicast nodes. Then modify the cost of the original path by average weight. The smaller average weight, the more priority the path is. Accordingly, it proposed MPH-BW algorithm. Experimental results show that computation time is shorter and solution is high quality in this algorithm.