Abstract

The genetic algorithm based on immunity has recently been an appealing research methodology in evolutionary computation. Aiming to cope with the problems of genetic algorithms, i.e., the solution is apt to trap into a local optimum and the convergence speed is slow, this paper proposes a new self-adjusting immune genetic algorithm, called SaiGa (Self-adjusted immune Genetic algorithm), which seeks for an optimal solution with regard to complex problems such as the optimization of multidimensional functions by automatically tuning the crossover and the mutation probabilities, which can help avoid prematurity phenomena and maintain individual diversity. In particular, SaiGa introduces a variable optimization approach to improve the precision in terms of solving complex problems. The empirical results demonstrate that SaiGa can greatly accelerate convergence for finding an optimal solution compared with genetic algorithms and immune algorithms, achieve a better precision in function optimization, and avoid prematurity convergence.KeywordsImmune genetic algorithmsGenetic algorithmsSelf- adjusting

Full Text
Paper version not known

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.