Adaptive mutation depending on program size in asynchronous program evolution

摘要

This paper proposes an adaptive mutation method which changes a mutation rate depending on the program size in the asynchronous program evolution unlike the synchronous program evolution such as genetic programming. An intensive experiment with an evolution of calculation programs has revealed that the proposed adaptive mutation method can generate the correct and short programs in comparison with other methods.