Skip to main content

Shuffle and Mate: A Dynamic Model for Spatially Structured Evolutionary Algorithms

  • Conference paper
Book cover Parallel Problem Solving from Nature – PPSN XIII (PPSN 2014)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alba, E., Dorronsoro, B.: The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE Trans. Evol. Computation 9, 126–142 (2005)

    Article  Google Scholar 

  2. Cantú-Paz, E.: Migration Policies, Selection Pressure, and Parallel EAs. Journal of Heuristics, 311–334 (2001)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. Ilachinski, A., Cellular Automata, A.: Discrete Universe, World Scientific (2001)

    Google Scholar 

  7. 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)

    Article  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Steinmetz, R., Wehrle, K. (eds.): Peer-to-Peer Systems and Applications. LNCS, vol. 3485. Springer, Heidelberg (2005)

    Google Scholar 

  10. Tomassini, M.: Spatially Structured Evolutionary Algorithms. Springer (2005)

    Google Scholar 

  11. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics