Noisy combinatorial optimisation by evolutionary algorithms
N.A. Aishwaryaprajna, Jonathan E. Rowe · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2019
We investigate the effectiveness of a set of evolutionary algorithms on noisy combinatorial optimisation problems. Despite some of these having polynomial runtime bounds for noisy OneMax, we find that in practice they are not able to solve this problem in reasonable time, with the exception of the Paired Crossover EA, and UMDA. We further study the performance of these two algorithms on noisy versions of SubsetSum and Knapsack.