Landscape analysis for multicast routing

In this paper we present a solution to the NP-complete problem of multicast routing using landscape analysis technique based upon simulated annealing with logarithmic cooling. Local decisions are based upon Steiner-tree heuristics. The approach is benchmarked against three standard data sets from the OR library, with and without noise being present. A comparison is made with genetic algorithmic approaches to the same problem