A memetic algorithm for the optimum communication spanning tree problem

Authors:
Thomas Fischer;Peter Merz
Affiliations:
Distributed Algorithms Group, University of Kaiserslautern, Germany;Distributed Algorithms Group, University of Kaiserslautern, Germany
Venue:
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Year:
2007

Citing 5
Cited 4

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Approximation algorithms for some optimum communication spanning tree problems

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Orientation matters: how to efficiently solve ocst problems with problem-specific EAs

Proceedings of the 10th annual conference on Genetic and evolutionary computation
New insights into the OCST problem: integrating node degrees and their location in the graph

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Solving OCST problems with problem-specific guided local search

Proceedings of the 12th annual conference on Genetic and evolutionary computation
New hybrid genetic algorithm for solving optimal communication spanning tree problem

Proceedings of the 2011 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each pair of nodes routed over the tree. We present a memetic algorithm (MA) for this problem and focus our discussion on the evaluation of recombination operators for the OCST. The proposed algorithm outperforms evolutionary algorithms (EA) for known benchmark instances and outperforms state-of-the-art solvers for non-Euclidean instances.