Stage-oe-small.jpg

Techreport1740: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
K (Textersetzung - „ID Number“ durch „Archivierungsnummer“)
 
(3 dazwischenliegende Versionen von 2 Benutzern werden nicht angezeigt)
Zeile 1: Zeile 1:
{{Publikation Author
+
{{Publikation Erster Autor
|Rank=1
+
|ErsterAutorNachname=Branke
|Author=Jürgen Branke
+
|ErsterAutorVorname=Jürgen
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
Zeile 17: Zeile 17:
 
|Address=76128 Karlsruhe, Germany
 
|Address=76128 Karlsruhe, Germany
 
|Institution=University of Karlsruhe, Institute AIFB
 
|Institution=University of Karlsruhe, Institute AIFB
|ID Number=1740
+
|Reviewed=Daniel M. Herzig
 +
|Archivierungsnummer=1740
 
}}
 
}}
 
{{Publikation Details
 
{{Publikation Details
Zeile 31: Zeile 32:
 
Different methods for handling such changes are
 
Different methods for handling such changes are
 
given and experimentally compared in this study.
 
given and experimentally compared in this study.
|VG Wort-Seiten=
 
 
|Download=2008_1740_Branke_Addressing_Chan_1.pdf, 2008_1740_Branke_Addressing_Chan_1.ps
 
|Download=2008_1740_Branke_Addressing_Chan_1.pdf, 2008_1740_Branke_Addressing_Chan_1.ps
|DOI Name=
+
|Forschungsgruppe=Effiziente Algorithmen
|Projekt=
 
|Forschungsgruppe=
 
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl

Aktuelle Version vom 1. Oktober 2009, 14:41 Uhr


Addressing Change within a Generation




Published: 2008 März
Institution: University of Karlsruhe, Institute AIFB
Erscheinungsort / Ort: 76128 Karlsruhe, Germany
Archivierungsnummer: 1740

BibTeX



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



Forschungsgruppe

Effiziente Algorithmen


Forschungsgebiet

Evolutionäre Algorithmen, Evolutionäre Optimierung veränderlicher Probleme