Name
Abstract | ||
|---|---|---|
Linear functions play a key role in the runtime analysis of evolutionary algorithms and studies have provided a wide range of new insights and techniques for analyzing evolutionary computation methods. Motivated by studies on separable functions and the optimization behaviour of evolutionary algorithms as well as objective functions from the area of chance constrained optimization, we study the class of objective functions that are weighted sums of two transformed linear functions. Our results show that the (1+1) EA, with a mutation rate depending on the number of overlapping bits of the functions, obtains an optimal solution for these functions in expected time
$$O(n \log n)$$
, thereby generalizing a well-known result for linear functions to a much wider range of problems. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/978-3-031-14721-0_38 | Parallel Problem Solving from Nature – PPSN XVII |
DocType | Volume | ISSN |
Conference | 13399 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frank Neumann | 1 | 1727 | 124.28 |
| Carsten Witt | 2 | 987 | 59.83 |