Abstract
The size of the population can be critical in many application of genetic algorithm. And the probabilities of crossover and mutation have an effect on the diversity of population and the convergence of algorithm. In this paper we propose an adaptive method for crossover and mutation probabilities, which change with the varying population size. This algorithm could make great progress in searching for the global optimization. The experimental results indicate some merits of the proposed method.
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.
