Abstract
The purpose of this paper is to attempt to verify how the schema theorem affects the behavior of a genetic algorithm (GA) and uncover the relationships between building blocks and increasing schemata. From the analysis of schema tracing, the schema theorem should be interpreted carefully with precise definitions of building block and increasing schema. In addition, we find that an important type of above-average schemata that are not building blocks, which we call phenotypic schemata, always exists among the schemata receiving increasing evaluations during the GA search. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
