Abstract
An evolutionary programming algorithm with adaptive mutation operators based on Levy probability distribution is studied. Levy stable distribution has an infinite second moment. Because of this, Levy mutation is more likely to generate an offspring that is farther away from its parent than Gaussian mutation, which is often used in evolutionary algorithms. Such likelihood depends on a parameter /spl alpha/ in the distribution. Based on this, we propose an adaptive Levy mutation in which four different candidate offspring are generated by each parent, according to /spl alpha/=1.0, 1.3, 1.7, and 2.0, and the best one is chosen as the offspring for the next generation. The proposed algorithm was applied to several multivariate function optimization problems. We show empirically that the performance of the proposed algorithm was better than that of classical evolutionary algorithms using Gaussian mutation.
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.
