Revision as of 19:48, 1 February 2010 edit 138.246.7.32 (talk) Fixed example for defining length. New value ist consistent with The Genetic Algorithm in Computer Science by Eric Krevice Prebys ← Previous edit		Revision as of 16:40, 5 February 2010 edit undo 77.0.62.66 (talk) The defining length was measured wrong. It was 3 and I changed it to the right value of 5. Next edit →
Line 3: == Description == For example, consider binary strings of length 6. The schema 1*01 describes the set of all strings of length 6 with 1's at positions 1 and 6 and a 0 at position 4. The * is a [[Wildcard character\|wildcard]] symbol, which means that positions 2, 3 and 5 can have a value of either 1 or 0. The ''order of a schema'' is defined as the number of fixed positions in the template, while the ''[[defining length]]'' <math> \delta(H) </math> is the distance between the first and last specific positions. The order of 1*01 is 3 and its defining length is 35. The ''fitness of a schema'' is the average fitness of all strings matching the schema. The fitness of a string is a measure of the value of the encoded problem solution, as computed by a problem-specific evaluation function. ==See also==

Schema (genetic algorithms): Difference between revisions