Techreport1740: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
Zeile 1: | Zeile 1: | ||
− | {{Publikation | + | {{Publikation Erster Autor |
− | | | + | |ErsterAutorNachname=Branke |
− | | | + | |ErsterAutorVorname=Jürgen |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
Zeile 38: | Zeile 38: | ||
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
− | |Forschungsgebiet=Evolutionäre | + | |Forschungsgebiet=Evolutionäre Optimierung veränderlicher Probleme |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
− | |Forschungsgebiet=Evolutionäre | + | |Forschungsgebiet=Evolutionäre Algorithmen |
}} | }} |
Version vom 8. September 2009, 09:52 Uhr
Published: 2008
März
Institution: University of Karlsruhe, Institute AIFB
Erscheinungsort / Ort: 76128 Karlsruhe, Germany
Archivierungsnummer:1740
Kurzfassung
Many practical optimization problems change over time, requiring a
repeated re-adaptation of the solution. As has been shown in numerous
papers, evolutionary algorithms (EAs) can be modified so that they
can cope well with dynamic environments. However, basically all papers so far
either considered a continuous change, or a change that happens in
intervals which coincide with the time to complete a number of
generations. In reality, changes may occur at any time and irregular
intervals, which raises the question how to deal with a change
occurring within a generation of an EA.
Different methods for handling such changes are
given and experimentally compared in this study.
Download: Media:2008_1740_Branke_Addressing_Chan_1.pdf,Media:2008_1740_Branke_Addressing_Chan_1.ps
Evolutionäre Algorithmen, Evolutionäre Optimierung veränderlicher Probleme