Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
verfasst von : Martin Berlakovich, Mario Ruthmair, Günther R. Raidl
Erschienen in: Computer Aided Systems Theory – EUROCAST 2011
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem. The problem appears in practice for example when designing a distribution network with a guarantee of timely delivery. Another example is be a centralized broadcasting network where the delaybound represents a quality of service constraint. We introduce a multilevel-based construction heuristic which uses a new measurement for the suitability of edges to create a solution for the problem. In comparison to existing heuristics the main intention is not to create a minimum cost spanning tree, but a solution with a high potential for further improvement. Experimental results indicate that in most cases our approach produces solutions that after local improvement are of higher quality than those of other existing construction techniques.