Analysis of Asymmetric Mutation Model in Random Local Search

In a standard Evolutionary Algorithms (EAs), one uses the same rate for mutations from bit 1 to bit 0 and its reverse direction. There are many reports that the asymmetric mutation model is a very powerful strategy in EAs to obtain better solutions more efficiently. In this paper, we report stochastic behaviors of algorithms that are asymmetric mutation models of Random Local Search (RLS). The mathematical structure of asymmetry model can be derived in terms of a finite Markov chain. We demonstrate some useful results representing the effects of asymmetric mutation.

[1]  Marius Iosifescu,et al.  Finite Markov Processes and Their Applications , 1981 .

[2]  Frank Neumann,et al.  Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators , 2007, Evolutionary Computation.

[3]  Xin Yao,et al.  Runtime Analysis of Evolutionary Algorithms for Discrete Optimization , 2011, Theory of Randomized Search Heuristics.

[4]  K. Wada,et al.  A neo-Darwinian algorithm: asymmetrical mutations due to semiconservative DNA-type replication promote evolution. , 1993, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Makoto Sakamoto,et al.  Markov Chain Analyses of Random Local Search and Evolutionary Algorithm , 2014, J. Robotics Netw. Artif. Life.