A new schema theorem for uniform crossover based on ternary representation

Liang Ming*, Yu Ping Wang, Yiu Ming CHEUNG

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

Crossover is a fundamental operator in genetic algorithms, through which not only an existing schema may be either eliminated or survived, but also a new schema is constructed via other existing schemata. Unfortunately, the traditional schema theorem (Holland 1975) does not take into account the positive effects of a schema construction through crossover operation. Recently, some works have been done by considering the schema construction, but they could not well characterize the evolution of a schema via crossover. In this paper, we propose a new representation of a schema called ternary representation, through which the survival and construction probabilities of a schema are given out, respectively. Eventually, we present a new improved schema theorem that considers both schema survival and construction in a uniform crossover.

Original languageEnglish
Title of host publicationProceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04
EditorsM. Palaniswami, B. Krishnamachari, A. Sowmya, S. Challa, M. Palaniswami, B. Krishnamachari, A. Sowmya, S. Challa
Pages235-239
Number of pages5
Publication statusPublished - 2004
Event2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04 - Melbourne, Australia
Duration: 14 Dec 200417 Dec 2004

Publication series

NameProceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04

Conference

Conference2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP '04
Country/TerritoryAustralia
CityMelbourne
Period14/12/0417/12/04

Scopus Subject Areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'A new schema theorem for uniform crossover based on ternary representation'. Together they form a unique fingerprint.

Cite this