Evaluation of heavy-tailed mutation operator on maximum flow test generation problem
Vladimir Mironovich, Maxim Buzdalov · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2017
The general recommendation for the mutation rate in standard-bit mutation is 1/n, which gives asymptotically optimal expected optimization times for several simple test problems. Recently, Doerr et al. have shown that such mutation rate is not ideal, and is far from optimal for multimodal problems. They proposed the heavy-tailed mutation operator fmutβ which significantly improves performance of the (1+1) evolutionary algorithm on Jump problem and yields similar speed-ups for the vertex cover problem in bipartite graphs and the matching problem in general graphs.