Dynamic and partially connected ring topologies for evolutionary algorithms with structured populations

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

Abstract

This paper investigates dynamic and partially connected ring topologies for cellular Evolutionary Algorithms (cEA). We hypothesize that these structures maintain population diversity at a higher level and reduce the risk of premature convergence to local optima on deceptive, multimodal and NP-hard fitness landscapes. A general framework for modelling partially connected topologies is proposed and three different schemes are tested. The results show that the structures improve the rate of convergence to global optima when compared to cEAs with standard topologies (ring, rectangular and square) on quasideceptive, deceptive and NP-hard problems. Optimal population size tests demonstrate that the proposed topologies require smaller populations when compared to traditional cEAs.

Cite

CITATION STYLE

APA

Fernandes, C. M., Laredo, J. L. J., Merelo, J. J., Cotta, C., & Rosa, A. C. (2014). Dynamic and partially connected ring topologies for evolutionary algorithms with structured populations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8602, pp. 665–677). Springer Verlag. https://doi.org/10.1007/978-3-662-45523-4_54

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