Adaptive Simulated Annealing Genetic Algorithm for System Identification Engineering

Cited 0 time in webofscience Cited 115 time in scopus
  • Hit : 721
  • Download : 143
DC FieldValueLanguage
dc.contributor.authorJeong, Il-Kwon-
dc.contributor.authorLee, Ju-Jang-
dc.date.accessioned2009-01-12T05:41:50Z-
dc.date.available2009-01-12T05:41:50Z-
dc.date.issued2005-
dc.identifier.citationAdvances in Engineering Software, Volume 37, Issue 6, June 2006, Pages 406-418en
dc.identifier.issn0952-1976-
dc.identifier.urihttp://hdl.handle.net/10203/8288-
dc.description.abstractGenetic algorithms and simulated annealing are leading methods of search and optimization. This paper proposes an efficient hybrid genetic algorithm named ASAGA (Adaptive Simulated Annealing Genetic Algorithm). Genetic algorithms are global search techniques for optimization. However, they are poor at hill-climbing. Simulated annealing has the ability of probabilistic hill-climbing. Therefore, the two techniques are combined here to produce an adaptive algorithm that has the merits of both genetic algorithms and simulated annealing, by introducing a mutation operator like simulated annealing and an adaptive cooling schedule. The validity and the efficiency of the proposed algorithm are shown by an example involving system identification.en
dc.language.isoen_USen
dc.publisherElsevieren
dc.subjectGenetic algorithmen
dc.subjectSimulated annealingen
dc.subjectSystem identificationen
dc.titleAdaptive Simulated Annealing Genetic Algorithm for System Identification Engineeringen
dc.typeArticleen
dc.identifier.doi10.1016/j.advengsoft.2005.08.002-
Appears in Collection
EE-Journal Papers(저널논문)

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0