A modified differential evolution algorithm applied to challenging benchmark problems of dynamic optimization

Authors:
Ankush Mandal;Aveek Kumar Das;Prithwijit Mukherjee
Affiliations:
ETCE department, Jadavpur University, Kolkata, India;ETCE department, Jadavpur University, Kolkata, India;ETCE department, Jadavpur University, Kolkata, India
Venue:
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Year:
2011

Citing 5
Cited 0

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
A Generalized Approach to Construct Benchmark Problems for Dynamic Optimization

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
The differential ant-stigmergy algorithm applied to dynamic optimization problems

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Dynamic optimization using self-adaptive differential evolution

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Differential Evolution: A Survey of the State-of-the-Art

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many real-world optimization problems are dynamic in nature. In order to deal with these Dynamic Optimization Problems (DOPs), an optimization algorithm must be able to continuously locate the optima in the constantly changing environment. In this paper, we propose a multi-population based differential evolution (DE) algorithm to address DOPs. This algorithm, denoted by pDEBQ, uses Brownian & adaptive Quantum individuals in addition to DE individuals to increase the diversity & exploration ability. A neighborhood based new mutation strategy is incorporated to control the perturbation & there by to prevent the algorithm from converging too quickly. Furthermore, an exclusion rule is used to spread the subpopulations over a larger portion of the search space as this enhances the optima tracking ability of the algorithm. Performance of pDEBQ algorithm has been evaluated over a suite of benchmarks used in Competition on Evolutionary Computation in Dynamic and Uncertain Environments, CEC'09.