Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/84643
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSuganthan, P. N.en
dc.contributor.authorSheldon Hui.en
dc.date.accessioned2013-07-23T03:09:01Zen
dc.date.accessioned2019-12-06T15:48:52Z-
dc.date.available2013-07-23T03:09:01Zen
dc.date.available2019-12-06T15:48:52Z-
dc.date.copyright2012en
dc.date.issued2012en
dc.identifier.citationHui, S., & Suganthan, P. N. (2012). Ensemble Differential Evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems. 2012 IEEE Congress on Evolutionary Computation (CEC).en
dc.identifier.urihttps://hdl.handle.net/10356/84643-
dc.description.abstractMany real-life optimization problems are dynamic in time, demanding optimization algorithms to perform search for the best solutions in a time-varying problem space. Among population-based Evolutionary Algorithms (EAs), Differential Evolution (DE) is a simple but highly effective method that has been successfully applied to a wide variety of problems. We propose a technique to solve dynamic optimization problems (DOPs) using a multi-population version of DE that incorporates an ensemble of adaptive mutation strategies with a greedy tournament global search method, as well as keeps track of past good solutions in an archive with adaptive clearing to enhance population diversity.en
dc.language.isoenen
dc.rights© 2012 IEEE.en
dc.subjectDRNTU::Engineering::Electrical and electronic engineeringen
dc.titleEnsemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problemsen
dc.typeConference Paperen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.contributor.conferenceIEEE Congress on Evolutionary Computation (2012 : Brisbane, Australia)en
dc.identifier.doi10.1109/CEC.2012.6252866en
item.fulltextNo Fulltext-
item.grantfulltextnone-
Appears in Collections:EEE Conference Papers

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.