Expected runtimes of a simple multi-objective evolutionary algorithm
Oliver Giel · 2004
The expected runtime of a simple multi-objective evolutionary algorithm for the Boolean decision space is analyzed. The algorithm uses independent bit flips as mutation operator and, therefore, searches globally. It is proved that the expected runtime is O(n/sup n/) for all objective functions {0,1}/sup n/ /spl rarr/ R/sup m/. This worst-case bound is tight and matches the worst-case bounds for fundamental evolutionary algorithms working in the scenario of single-objective optimization. For the bicriteria problem LOTZ (leading ones trailing zeroes), it is shown that the expected runtime is O(n/sup 3/). Moreover, the runtime is O(n/sup 3/) with an overwhelming probability.