A memetic algorithm and a solution archive for the rooted delay-constrained minimum spanning tree problem

Authors:
Mario Ruthmair;Günther R. Raidl
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Venue:
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Year:
2011

Citing 9
Cited 0

Some Approximation Results in Multicasting

Some Approximation Results in Multicasting
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Modeling and solving the rooted distance-constrained minimum spanning tree problem

Computers and Operations Research
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Computer Aided Systems Theory - EUROCAST 2009
Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Stabilized branch-and-price for the rooted delay-constrained steiner tree problem

INOC'11 Proceedings of the 5th international conference on Network optimization
A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

Applied Intelligence
Enhancing genetic algorithms by a trie-based complete solution archive

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a memetic algorithm for a combinatorial optimization problem called rooted delay-constrained minimum spanning tree problem arising for example in centralized broadcasting networks where quality of service constraints are of concern. The memetic algorithm is based on a specialized solution representation and a simple and effective decoding mechanism. Solutions are locally improved by a variable neighborhood descent in two neighborhood structures. Furthermore, to tackle the problem of repeated examination of already visited solutions we investigate a simple hash-based method to only detect duplicates or, alternatively, a trie-based complete solution archive to additionally derive new unvisited solutions. Experimental results show that our memetic algorithm outperforms existing heuristic approaches for this problem in most cases. Including the hash-based duplicate detection mostly further improves solution quality whereas the solution archive can only rarely obtain better results due to its operational overhead.