Landscape analysis for multicast routing.
Full text is not in this repository.
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.
|Research Areas:||A. > School of Science and Technology
A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > SensoLab group
|Depositing User:||Repository team|
|Date Deposited:||17 Oct 2008 15:18|
|Last Modified:||07 Dec 2015 18:25|
Actions (login required)