Analysis of heuristics for the design of tree networks
Annals of Operations Research - Special issue on operations research in telecommunications
A fast and simple Steiner routing heuristic
Discrete Applied Mathematics - Special volume on VLSI
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Network random keys: a tree representation scheme for genetic and evolutionary algorithms
Evolutionary Computation
An Effective Implementation of a Direct Spanning Tree Representation in GAs
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem
AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Deterministic Polylog Approximation for Minimum Communication Spanning Trees
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Redundant representations in evolutionary computation
Evolutionary Computation
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
A scalable genetic algorithm for the rectilinear Steiner problem
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
IEEE Transactions on Evolutionary Computation
Edge sets: an effective evolutionary coding of spanning trees
IEEE Transactions on Evolutionary Computation
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Proceedings of the 2011 ACM Symposium on Applied Computing
A productivity-oriented methodology for local area network design in industrial environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
This paper presents an experimental investigation into the properties of the optimal communication spanning tree (OCST) problem. The OCST problem seeks a spanning tree that connects all the nodes and satisfies their communication requirements at a minimum total cost. The paper compares the properties of random trees to the properties of the best solutions for the OCST problem that are found using an evolutionary algorithm. The results show, on average, that the optimal solution and the minimum spanning tree (MST) share a higher number of links than the optimal solution and a random tree. Furthermore, optimal solutions for OCST problems with randomly chosen distance weights share a higher number of links with an MST than OCST problems with Euclidean distance weights. This intuitive similarity between optimal solutions and MSTs suggests that some heuristic optimization methods for OCST problems might be improved by starting with an MST. Using an MST as a starting solution for a greedy search in the tested cases either improves median running time up to a factor of 10 while finding solutions of the same quality, or increases solution quality up to a factor of 100 while using the same number of search steps in comparison to starting the greedy search from a random tree. Starting a local search, a simulated annealing approach and a genetic algorithm from an MST increases solution quality up to a factor of three in comparison to starting from a random solution.