On the Optimahttp://lss.sub.uni-hamburg.de/admin/l Communication Spanning Tree Problem

This paper presents an investigation into the properties of the optimal communication spanningtree (OCST) problem. The OCST problem nds a spanning tree that connects all nodesand satises their communication requirements for a minimum total cost. The paper comparesthe properties of randomly created solutions to the best solutions that are found using an evolutionaryalgorithm framework. The results show that on average the distance between theoptimal solution and the minimum spanning tree (MST) that is calculated according to thedistance weights is signicantly smaller than the distance between a randomly created solutionand the MST.[...]

MoreLess

Year of publication:	2003-05-03
Authors:	Rothlauf, Franz ; Gerstacker, Jürgen ; Heinzl, Armin
Subject:	Evolutionärer Algorithmus \| Minimal spannender Baum \| minimum communication spanning tree

Check Google Scholar |

More access options

In German libraries (KVK)

I need help

1 Introduction
2 The Optimal Communication Spanning Tree Problem
2.1 Problem Description
2.2 Analysis of Existing Problem Instances
3 Statistical Analysis of the OCST problem
3.1 Randomly Generated Solutions for the OCST Problem
3.2 Optimal Solutions for the OCST Problem
3.3 Discussion
4 Future Research
5 Summary and Conclusions
References

Persistent link: https://www.econbiz.de/10005868180