Rigorous Runtime Analysis of Permutation-based Evolutionary Algorithms on Classic Benchmarks

The author proposes a general way to translate classic pseudo-Boolean optimization benchmarks into permutation-based problems, and conducts a rigorous runtime analysis of the permutation-based (1+1) EA on the analogues of the LeadingOnes and Jump benchmarks. The analysis reveals new challenges and insights compared to the bit-string case, leading to the suggestion of using scramble mutations over swap mutations, and heavy-tailed mutation strengths.