Ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems
Many 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 bee...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Conference Paper |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/84643 http://hdl.handle.net/10220/12029 |
_version_ | 1826123698387550208 |
---|---|
author | Suganthan, P. N. Sheldon Hui. |
author2 | School of Electrical and Electronic Engineering |
author_facet | School of Electrical and Electronic Engineering Suganthan, P. N. Sheldon Hui. |
author_sort | Suganthan, P. N. |
collection | NTU |
description | Many 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. |
first_indexed | 2024-10-01T06:08:34Z |
format | Conference Paper |
id | ntu-10356/84643 |
institution | Nanyang Technological University |
language | English |
last_indexed | 2024-10-01T06:08:34Z |
publishDate | 2013 |
record_format | dspace |
spelling | ntu-10356/846432020-03-07T13:24:44Z Ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems Suganthan, P. N. Sheldon Hui. School of Electrical and Electronic Engineering IEEE Congress on Evolutionary Computation (2012 : Brisbane, Australia) DRNTU::Engineering::Electrical and electronic engineering Many 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. 2013-07-23T03:09:01Z 2019-12-06T15:48:52Z 2013-07-23T03:09:01Z 2019-12-06T15:48:52Z 2012 2012 Conference Paper Hui, 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). https://hdl.handle.net/10356/84643 http://hdl.handle.net/10220/12029 10.1109/CEC.2012.6252866 en © 2012 IEEE. |
spellingShingle | DRNTU::Engineering::Electrical and electronic engineering Suganthan, P. N. Sheldon Hui. Ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems |
title | Ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems |
title_full | Ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems |
title_fullStr | Ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems |
title_full_unstemmed | Ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems |
title_short | Ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems |
title_sort | ensemble differential evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems |
topic | DRNTU::Engineering::Electrical and electronic engineering |
url | https://hdl.handle.net/10356/84643 http://hdl.handle.net/10220/12029 |
work_keys_str_mv | AT suganthanpn ensembledifferentialevolutionwithdynamicsubpopulationsandadaptiveclearingforsolvingdynamicoptimizationproblems AT sheldonhui ensembledifferentialevolutionwithdynamicsubpopulationsandadaptiveclearingforsolvingdynamicoptimizationproblems |