Abstract
AbstractGenetic algorithms are random heuristic search (RHS) algorithms which can be theoretically described with the help of a dynamical system model. This model characterises the stochastic trajectory of a population using a deterministic heuristic function and its fixed points. For practical problem sizes the determination of the fixed points is unfeasible even for the simple genetic algorithm (SGA). In this paper the novel intrinsic system model is introduced for the genetic algorithm with α-selection and the corresponding unique fixed point is determined. It is shown that this model is compatible with the equivalence relation imposed by schemata. In addition to the theoretical analysis experimental results are presented which confirm the theoretical predictions.
Sign-in/Register to access full text options 
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.
