Abstract
It is known that modelling a finite population genetic algorithm as a Markov chain requires a prohibitively large number of states. In an attempt to resolve this problem, a number of state aggregation techniques have been proposed. We consider two different strategies for aggregating populations, one using equal average fitness and the other using equal best fitness. We examine how the approximation scales with population size, in addition to studying the effects of other parameters (such as mutation rate). We find that a large reduction in the number of states is possible, sometimes with surprisingly small loss of accuracy.
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.
