Abstract
This paper studies a self-organized framework for modeling dynamic topologies in spatially structured Evolutionary Algorithms (EAs). The model consists of a 2-dimensional grid of nodes where the individuals interact and self-organize into clusters. During the search process, the individuals move through the grid, following a pre-defined simple rule. In order to evaluate the model, a dynamic cellular Genetic Algorithm (dcGA) is built over the proposed topology and four different movement rules are tested. The results show that when the ratio between the number of nodes in the grid and the population size is above 4:1, the individuals self-organize into highly dynamic clusters and significantly improve results attained by standard cGAs with static topologies on a set of deceptive and multimodal functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alba, E., Dorronsoro, B.: The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE Trans. Evol. Computation 9, 126–142 (2005)
Cantú-Paz, E.: Migration Policies, Selection Pressure, and Parallel EAs. Journal of Heuristics, 311–334 (2001)
Fernandes, C.M., Laredo, J.L.L., Merelo, J.J., Cotta, C., Rosa, A.C.: Towards a 2-dimensional Framework for Structured Population-based Metaheuristics. In: Proc. of IEEE International Conference on Complex Systems, pp. 1–6 (2012)
Fernandes, C.M., Laredo, J.L.L., Merelo, J.J., Cotta, C., Rosa, A.C.: A Study on Time-Varying Partially Connected Topologies for the Particle Swarm. In: Proc. of the IEEE Congress on Evolutionary Computation, pp. 2450–2456. IEEE (2013)
Grassé La, P.-P.: reconstrucion du nid et les coordinations interindividuelles chez bellicositermes et cubitermes sp. La théorie de la stigmergie: Essai d’interpretation du comportement des termites constructeurs. Insectes Sociaux 6, 41–80 (1959)
Ilachinski, A., Cellular Automata, A.: Discrete Universe, World Scientific (2001)
Laredo, J.L.J., Castillo, P.A., Mora, A.M., Merelo, J.J., Fernandes, C.M.: Resilience to churn of a peer-to-peer evolutionary algorithm. International Journal of High Performance Systems Architecture 1(4), 260–268 (2008)
Nogueras, R., Cotta, C., Fernandes, C.M., Jiménez Laredo, J.L., Merelo, J.J., Rosa, A.C.: An analysis of a selecto-lamarckian model of multimemetic algorithms with dynamic self-organized topology. In: Dediu, A.-H., Martín-Vide, C., Truthe, B., Vega-Rodríguez, M.A. (eds.) TPNC 2013. LNCS, vol. 8273, pp. 205–216. Springer, Heidelberg (2013)
Steinmetz, R., Wehrle, K. (eds.): Peer-to-Peer Systems and Applications. LNCS, vol. 3485. Springer, Heidelberg (2005)
Tomassini, M.: Spatially Structured Evolutionary Algorithms. Springer (2005)
Whitacre, J.M., Sarker, R.A., Pham, Q.: The self-organization of interaction networks for nature-inspired optimization. IEEE Transactions on Evolutionary Computation 12, 220–230 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Fernandes, C.M., Laredo, J.L.J., Merelo, J.J., Cotta, C., Nogueras, R., Rosa, A.C. (2014). Shuffle and Mate: A Dynamic Model for Spatially Structured Evolutionary Algorithms. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds) Parallel Problem Solving from Nature – PPSN XIII. PPSN 2014. Lecture Notes in Computer Science, vol 8672. Springer, Cham. https://doi.org/10.1007/978-3-319-10762-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-10762-2_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10761-5
Online ISBN: 978-3-319-10762-2
eBook Packages: Computer ScienceComputer Science (R0)