This paper provides the first proof that the more complex σ-distance mechanism of the SPEA2 yields a provably superior approximation ability, and shows the first result showing a provable qualitative gap between the approximation abilities of these two algorithms.
Yasser Alghouass, Benjamin Doerr, Martin S. Krejca et al.· GECCO Companion· 0 citations
This work significantly enhance the understanding of the dynamics of the GSEMO, in particular, for the classic CountingOnesCountingZeros benchmark, and proves a lower bound of order Ω(n2 log n), for the first time matching the seminal upper bounds known for over twenty years.
Benjamin Doerr, Martin S. Krejca, Andre Opris· GECCO Companion· 0 citations
