Some novel locality results for the blob code spanning tree representation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
On the bias and performance of the edge-set encoding
IEEE Transactions on Evolutionary Computation
The property analysis of evolutionary algorithms applied to spanning tree problems
Applied Intelligence
Evolutionary optimization of service times in interactive voice response systems
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
There are many applications where it is necessary to find an optimal spanning tree. For several of these, recent research has suggested the use of genetic algorithms (GAs). Historically, the Pruumlfer code has been one of the most popular representations for spanning trees, due largely to the bijective mapping between genotype and phenotype. However, it is has attracted much criticism for its low locality, a primary reason for its poor performance in GAs. Other representations such as direct encoding and network random keys have been shown to be far more effective. In 2001, an alternative called the Blob code was identified and adapted for use in GAs. It was shown to exhibit significantly higher locality than the Pruumlfer code. For a simple test problem, a GA using the Blob code was found to substantially outperform one using the Pruumlfer code. This paper suggests an alternative called the Dandelion code, which is more efficient and exhibits yet higher locality. Although both direct encoding and NetKeys are shown to give better results on the test problems used in this paper, the Dandelion code should be considered as a strong alternative, particularly for very large networks