Refine
Year of publication
- 2018 (1774) (remove)
Document Type
- Article (1774) (remove)
Keywords
- gamma rays: general (17)
- cosmic rays (11)
- stars: massive (11)
- ISM: supernova remnants (10)
- Germany (9)
- climate change (9)
- radiation mechanisms: non-thermal (9)
- German (8)
- X-rays: binaries (8)
- astroparticle physics (7)
Institute
- Institut für Physik und Astronomie (244)
- Institut für Geowissenschaften (237)
- Institut für Biochemie und Biologie (222)
- Institut für Chemie (140)
- Department Psychologie (92)
- Institut für Umweltwissenschaften und Geographie (79)
- Department Linguistik (59)
- Institut für Mathematik (58)
- Zentrum für Lehrerbildung und Bildungsforschung (ZeLB) (57)
- Institut für Ernährungswissenschaft (48)
Rigorous runtime analysis is a major approach towards understanding evolutionary computing techniques, and in this area linear pseudo-Boolean objective functions play a central role. Having an additional linear constraint is then equivalent to the NP-hard Knapsack problem, certain classes thereof have been studied in recent works. In this article, we present a dynamic model of optimizing linear functions under uniform constraints. Starting from an optimal solution with respect to a given constraint bound, we investigate the runtimes that different evolutionary algorithms need to recompute an optimal solution when the constraint bound changes by a certain amount. The classical (1+1) EA and several population-based algorithms are designed for that purpose, and are shown to recompute efficiently. Furthermore, a variant of the (1+(λ,λ))GA for the dynamic optimization problem is studied, whose performance is better when the change of the constraint bound is small.