An approach to a problem in network design using genetic algorithms
An approach to a problem in network design using genetic algorithms
Weight-biased edge-crossover in evolutionary algorithms for two graph problems
Proceedings of the 2001 ACM symposium on Applied computing
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
Hi-index | 0.00 |
Edge-sets encode spanning trees directly by listing their edges. Evolutionary operators for edge-sets may be heuristic, considering the weights of edges they include in offspring, or naive, including edges without regard to their weights. Crossover operators that heuristically prefer shorter edges are strongly biased towards minimum spanning trees (MST); EAs that apply heuristic crossover generally perform poorly on spanning tree problems whose optimum solutions are not very similar to MSTs. For the edge-set encoding, a modified heuristic crossover called γ-TX implements variable bias towards low-weight edges and thus towards MSTs. The bias can be set arbitrarily between the strong bias of the heuristic crossover operator, or being unbiased. An investigation into the performance of EAs using the γ-TX for randomly created OCST problems of different types and OCST test instances from the literature present good results when setting the crossover-specific parameter γ properly. The presented results suggest that the original heuristic crossover operator of the edge-sets should be substituted by the modified γ-TX operator that allows us to control the bias towards the MST.