Landscape analysis for multicast routing.
Full text is not in this repository.
Official URL: http://www.sciencedirect.com/science?_ob=ArticleUR...
This item is available in the Library Catalogue
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. Middlesex University Schools and Centres > School of Science and Technology > Computer Science|
A. Middlesex University Schools and Centres > School of Science and Technology
A. Middlesex University Schools and Centres > School of Science and Technology > Computer Science > SensoLab group
|Citations on ISI Web of Science:||4|
|Deposited On:||17 Oct 2008 15:18|
|Last Modified:||05 Dec 2014 16:27|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year