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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Storn, R., Price, K.: Differential evolution: A simple and efficient heuristic for global optimizationover continuous spaces. Journal of Global Optimization 11, 341–359 (1997)
Brest, J., Zamuda, A., Boskovic, B., Maucec, M.S., Zumer, V.: Dynamic Optimization using Self-Adaptive Differential Evolution. In: Proc. 2009 Cong. on Evol. Comput., pp. 415–422 (2009)
Das, S., Suganthan, P.N.: Differential evolution – a survey of the state-of-the- art. IEEE Transactions on Evolutionary Computation 15, 4–31 (2011)
Li, C., Yang, S., Nguyen, T.T., Yu, E.L., Yao, X., Jin, Y., Beyer, H.-G., Suganthan, P.N.: Benchmark Generator for CEC 2009 Competition on Dynamic Optimization, Technical Report, University of Leicester, University of Birmingham, Nanyang Technological University (September 2008)
Li, C., Yang, S.: A Generalised Approach to Construct Benchmark Problems for Dynamic Optimization. In: Li, X., Kirley, M., Zhang, M., Green, D., Ciesielski, V., Abbass, H.A., Michalewicz, Z., Hendtlass, T., Deb, K., Tan, K.C., Branke, J., Shi, Y. (eds.) SEAL 2008. LNCS, vol. 5361, pp. 391–400. Springer, Heidelberg (2008)
Lung, R.I., Dumitrescu, D.: A collaborative model for tracking optima in dynamic environments. In: Proc. 2007 Congr. Evol. Comput., pp. 564–567 (2007)
Korosec, P., Silc, J.: The differential anti-stigmergy algorithm applied to dynamic optimization problems. In: Proc. 2009 Congr. Evol. Comput., pp. 407–414 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mandal, A., Das, A.K., Mukherjee, P. (2011). A Modified Differential Evolution Algorithm Applied to Challenging Benchmark Problems of Dynamic Optimization. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27172-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-27172-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27171-7
Online ISBN: 978-3-642-27172-4
eBook Packages: Computer ScienceComputer Science (R0)