The memory indexing evolutionary algorithm for dynamic environments

Aydin Karaman*, Şima Uyar, Gülşen Eryiǧit

*Bu çalışma için yazışmadan sorumlu yazar

Araştırma sonucu: Dergiye katkıKonferans makalesibilirkişi

20 Atıf (Scopus)

Özet

There is a growing interest in applying evolutionary algorithms to dynamic environments. Different types of changes in the environment benefit from different types of mechanisms to handle the change. In this study, the mechanisms used in literature are categorized into four groups. A new EA approach (MIA) which benefits from the EDA-like approach it employs for re-initializing populations after a change as well as using different change handling mechanisms together is proposed. Experiments are conducted using the 0/1 single knapsack problem to compare MIA with other algorithms and to explore its performance. Promising results are obtained which promote further study. Current research is being done to extend MIA to other problem domains.

Orijinal dilİngilizce
Sayfa (başlangıç-bitiş)563-573
Sayfa sayısı11
DergiLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Hacim3449
DOI'lar
Yayın durumuYayınlandı - 2005
EtkinlikEvoWorkshops 2005: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC - Lausanne, Switzerland
Süre: 30 Mar 20051 Nis 2005

Parmak izi

The memory indexing evolutionary algorithm for dynamic environments' araştırma başlıklarına git. Birlikte benzersiz bir parmak izi oluştururlar.

Alıntı Yap