Analyzing hyperplane synthesis in genetic algorithms using clustered schemata

Thang Nguyen Bui, Byung Ro Moon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

A new type of schema, c-schema, is introduced, which emphasizes the inner structure, particularly specific-symbol clusters rather than the defining length. A new type of building block, c-building block, is also suggested as a consequence of this. The expected survival probability of a schema based on this new schema model is given as well as a new explanation about how allelic reordering by depth first search can help improve genetic algorithms’ search capability. Extensive experimental results are also provided.

Original languageEnglish (US)
Title of host publicationParallel Problem Solving from Nature - PPSN III - International Conference on Evolutionary Computation, The 3rd Conference on Parallel Problem Solving from Nature, Proceedings
EditorsYuval Davidor, Hans-Paul Schwefel, Reinhard Manner
PublisherSpringer Verlag
Pages108-118
Number of pages11
ISBN (Print)9783540584841
DOIs
StatePublished - 1994
Event3rd International Conference on Parallel Problem Solving from Nature, PPSN III 1994 - Jerusalem, Israel
Duration: Oct 9 1994Oct 14 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume866 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on Parallel Problem Solving from Nature, PPSN III 1994
CountryIsrael
CityJerusalem
Period10/9/9410/14/94

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Analyzing hyperplane synthesis in genetic algorithms using clustered schemata'. Together they form a unique fingerprint.

Cite this