CellularDE: A cellular based differential evolution for dynamic optimization problems

52Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In real life we are often confronted with dynamic optimization problems whose optima change over time. These problems challenge traditional optimization methods as well as conventional evolutionary optimization algorithms. In this paper, we propose an evolutionary model that combines the differential evolution algorithm with cellular automata to address dynamic optimization problems. In the proposed model, called CellularDE, a cellular automaton partitions the search space into cells. Individuals in each cell, which implicitly create a subpopulation, are evolved by the differential evolution algorithm to find the local optimum in the cell neighborhood. Experimental results on the moving peaks benchmark show that CellularDE outperforms DynDE, cellular PSO, FMSO, and mQSO in most tested dynamic environments. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Noroozi, V., Hashemi, A. B., & Meybodi, M. R. (2011). CellularDE: A cellular based differential evolution for dynamic optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6593 LNCS, pp. 340–349). https://doi.org/10.1007/978-3-642-20282-7_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free