Edge-Sets: An Effective Evolutionary Coding of Spanning Trees (2002)
by
Günther R. Raidl
,
Bryant A. Julstrom
| Citations: | 13 - 7 self |
BibTeX
@MISC{Raidl02edge-sets:an,
author = {Günther R. Raidl and Bryant A. Julstrom},
title = {Edge-Sets: An Effective Evolutionary Coding of Spanning Trees},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The fundamental design choices in an evolutionary algorithm are its representation of candidate solutions and the operators that will act on that representation. We propose representing spanning trees in evolutionary algorithms for network design problems directly as sets of their edges, and we describe initialization, recombination, and mutation operators for this representation. The operators offer
