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â€¦ (More)

Given a connected, weighted, undirected graph <i>G</i> and a bound <i>D</i>, the bounded-diameter minimum spanning tree problem seeks a spanning tree on <i>G</i> of lowest weight in which no pathâ€¦ (More)

Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem extends the familiarâ€¦ (More)

Given a connected, weighted, undirected graph <i>G</i> and a bound <i>D</i>, the bounded diameter minimum spanning tree problem seeks a spanning tree on <i>G</i> of minimum weight among the trees inâ€¦ (More)

The quadratic multiple knapsack problem extends the quadratic knapsack problem with <i>K</i> knapsacks, each with its own capacity <i>C<sub>k</sub></i>. A greedy heuristic fills the knapsacks one atâ€¦ (More)

The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a genetic algorithm forâ€¦ (More)

Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Primâ€™s algorithm, and random keys can represent permutations. Though we might expectâ€¦ (More)

Among the many codings of spanning trees for evolutionary search are those based on bijections between Prüfer strings---strings of <i>n</i>-2 vertex labels---and spanning trees on the labeledâ€¦ (More)

Given a set of strings <i>S</i> of equal lengths over an alphabet σ, the closest string problem seeks a string over σ whose maximum Hamming distance to any of the given strings is as smallâ€¦ (More)