ScholarLens Back to search
2005•Wuhan University JournalRequires access

Schema Theory of the Decimal-Coded Genetic Algorithm

Zhong Shou-nan

Open publisher page 1 citations

Abstract

The schema theorems of the decimal-coded genetic algorithm are derived for single-point crossover assuming that the individual chromosomes are arranged as strings,n(≥2)-point crossover and uniform crossover assuming that the individual chromosomes form rings in this paper.Two faults of binary GA theorem are avoided in the schema theorems: independently picking crossover points and neglecting to create effects of crossover,and a conclusion that the operational mechanisms are similar if evolutionary levels of GA are consistent is derived.

About this research paper

What this paper is about

The schema theorems of the decimal-coded genetic algorithm are derived for single-point crossover assuming that the individual chromosomes are arranged as strings,n(≥2)-point crossover and uniform crossover assuming that the individual chromosomes form rings in this paper.Two faults of binary GA theorem are avoided in the schema theorems: independently picking crossover points and neglecting to create effects of crossover,and a conclusion that the operational mechanisms are similar if evolutionary levels of GA are consistent is derived.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The schema theorems of the decimal-coded genetic algorithm are derived for single-point crossover assuming that the individual chromosomes are arranged as strings,n(≥2)-point crossover and uniform crossover assuming that the individual chromosomes form rings in this paper.Two faults of binary GA theorem are avoided in the schema theorems: independently picking crossover points and neglecting to create effects of crossover,and a conclusion that the operational mechanisms are similar if evolutionary levels of GA are consistent is derived.

Key concepts: Crossover, Schema (genetic algorithms), Decimal, Algorithm, Binary number, Genetic algorithm, Computer science, Lattice (music)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Schema Theory of the Decimal-Coded Genetic Algorithm — Research Paper | ScholarLens