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 paper proves that several popular MOEAs, including NSGA-II, NSGA-III, SMS-EMOA, and SPEA2, only need an expected time of O(n2 log n) fitness evaluations to compute an additive ε-approximation of the Pareto front of the established LargeFront benchmark.
This first complete mathematical runtime analysis for the MOEA/D using the original weighted-sum decomposition shows that this variant of the algorithm solves the classic OneMinMax benchmark considerably faster than both the MOEA/D with Tchebycheff decomposition and many other classic algorithms such as the NSGA-II, NS...
Danyang Zhang, Zerong Zhong, Weijie Zheng et al.· Proceedings of the Genetic a...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
