Abstract

Genetic Algorithm (GA) has been proven to be easy in falling into local optimal value due to its fixed crossover and mutation probabilities, while the Adaptive Genetic Algorithm (AGA) has strong global search capability because the two probabilities adjust adaptively. The typical AGAs with linear adjustment of probabilities are compared and analyzed through standard test functions. Some enlightening conclusions are obtained, which provide ideas for the application of adaptive genetic algorithm.

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 call

Disclaimer: 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.