Schema (genetic algorithms): Difference between revisions

Revision as of 15:14, 15 December 2011

Revision as of 20:50, 24 March 2013

Line 3:

== Description ==

For example, consider binary strings of length 6. The schema 1**0*1 describes the set of all words of length 6 with 1's at positionsthe 1first and 6sixth andpositions a 0 at positionthe 4fourth position. 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**0*1 is 3 and its defining length is 5. 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.

===Length===