Name
Abstract | ||
|---|---|---|
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.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3319619.3321955 | GECCO |
Keywords | Field | DocType |
Noisy combinatorial optimisation, Gaussian noise, Expected runtime | Evolutionary algorithm,Computer science,Artificial intelligence,Machine learning | Conference |
ISBN | Citations | PageRank |
978-1-4503-6748-6 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aishwaryaprajna | 1 | 0 | 0.68 |
| Jonathan Rowe | 2 | 64 | 6.04 |