Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.
Bryant A. JulstromGünther R. RaidlPublished in: SAC (2002)
Keyphrases
- spanning tree
- evolutionary algorithm
- minimum cost
- minimum spanning tree
- edge disjoint
- undirected graph
- evolutionary computation
- multi objective
- minimum spanning trees
- evolution process
- multi objective optimization
- differential evolution algorithm
- fitness function
- genetic programming
- genetic algorithm
- data structure
- minimum total cost
- differential evolution
- optimization problems
- simulated annealing
- evolution strategy
- weighted graph
- root node
- special case