Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem
AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
A new evolutionary approach to the degree-constrained minimumspanning tree problem
IEEE Transactions on Evolutionary Computation
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On Optimal Solutions for the Optimal Communication Spanning Tree Problem
Operations Research
Genetic algorithm for delay- and degree-constrained multimedia broadcasting on overlay networks
Computer Communications
On the bias and performance of the edge-set encoding
IEEE Transactions on Evolutionary Computation
Asymmetric information distances for automated taxonomy construction
Knowledge and Information Systems
| Hi-index | 0.00 |
This paper presents an effective implementation based on predecessor vectors of a genetic algorithm using a direct tree representation. The main operations associated with crossovers and mutations can be achieved in O(d) time, where d is the length of a path. Our approach can avoid usual drawbacks of the fixed linear representations, and provide a framework facilitating the incorporation of problem-specific knowledge into initialization and operators for constrained minimum spanning tree problems.