Skip to main content

Testing the Intermediate Disturbance Hypothesis in Concurrent Evolutionary Algorithms

  • Conference paper
  • First Online:
Applied Computer Sciences in Engineering (WEA 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1274))

Included in the following conference series:

  • 942 Accesses

Abstract

Concurrency is a powerful abstraction that can be used to model and implement multi-deme evolutionary algorithms, opening up additional design questions such as what the different populations in various threads can do and how they interact with each other (via a combination of populations). One approach is synchrony: although threads can run asynchronously, they often perform the same amount of work, which brings a (rough) synchrony to appear within them. Our intention in this paper is to test if the intermediate disturbance hypothesis holds: this kind of synchrony is a small disturbance, which likewise big disturbances will not boost diversity; however, moderate disturbances will. We tested several ways of creating this intermediate disturbance by changing how different threads operate or modifying its working in alternative ways.

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 EPUB and 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

References

  1. Araujo, L., Guervós, J.J.M.: Diversity through multiculturality: assessing migrant choice policies in an Island model. IEEE Trans. Evol. Comput. 15(4), 456–469 (2011)

    Article  Google Scholar 

  2. Connell, J.H.: Diversity in tropical rain forests and coral reefs. Science 199(4335), 1302–1310 (1978)

    Article  Google Scholar 

  3. Fernandez, F., Vanneschi, L., Tomassini, M.: The effect of plagues in genetic programming: a study of variable-size populations. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 317–326. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36599-0_29

    Chapter  MATH  Google Scholar 

  4. Gao, H., Zang, W., Cao, J.: A particle swarm optimization with moderate disturbance strategy. In: Proceedings of the 32nd Chinese Control Conference, pp. 7994–7999. IEEE (2013)

    Google Scholar 

  5. Goldberg, D.E.: Zen and the art of genetic algorithms. In: Schaffer, J.D. (ed.) ICGA, pp. 80–85. Morgan Kaufmann (1989)

    Google Scholar 

  6. Grime, J.P.: Competitive exclusion in herbaceous vegetation. Nature 242(5396), 344–347 (1973)

    Article  Google Scholar 

  7. He, Y., Wang, A., Su, H., Wang, M.: Particle swarm optimization using neighborhood-based mutation operator and intermediate disturbance strategy for outbound container storage location assignment problem. Math. Probl. Eng. 2019 (2019)

    Google Scholar 

  8. Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666–677 (1978). https://doi.org/10.1145/359576.359585

    Article  MATH  Google Scholar 

  9. Jansen, T., Zarges, C.: Analyzing different variants of immune inspired somatic contiguous hypermutations. Theoret. Comput. Sci. 412(6), 517–533 (2011)

    Article  MathSciNet  Google Scholar 

  10. Lenz, M.: Perl 6 Fundamentals. Apress, Berkeley (2017). https://doi.org/10.1007/978-1-4842-2899-9

    Book  Google Scholar 

  11. Merelo, J.J., García-Valdez, J.-M.: Going stateless in concurrent evolutionary algorithms. In: Figueroa-García, J.C., López-Santana, E.R., Rodriguez-Molano, J.I. (eds.) WEA 2018. CCIS, vol. 915, pp. 17–29. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00350-0_2

    Chapter  Google Scholar 

  12. Merelo, J.J., García-Valdez, J.M.: Mapping evolutionary algorithms to a reactive, stateless architecture: using a modern concurrent language. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2018, pp. 1870–1877. ACM, New York (2018). https://doi.org/10.1145/3205651.3208317. http://doi.acm.org/10.1145/3205651.3208317

  13. Merelo, J.J., Laredo, J.L.J., Castillo, P.A., García-Valdez, J.-M., Rojas-Galeano, S.: Scaling in concurrent evolutionary algorithms. In: Figueroa-García, J.C., Duarte-González, M., Jaramillo-Isaza, S., Orjuela-Cañon, A.D., Díaz-Gutierrez, Y. (eds.) WEA 2019. CCIS, vol. 1052, pp. 16–27. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31019-6_2

    Chapter  Google Scholar 

  14. Merelo, J.J., et al.: Testing the intermediate disturbance hypothesis: effect of asynchronous population incorporation on multi-deme evolutionary algorithms. In: Rudolph, G., Jansen, T., Beume, N., Lucas, S., Poloni, C. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 266–275. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87700-4_27

    Chapter  Google Scholar 

  15. Merelo-Guervós, J.J., García-Sánchez, P.: Modeling browser-based distributed evolutionary computation systems. CoRR abs/1503.06424 (2015). http://arxiv.org/abs/1503.06424

  16. Merelo, J.J., Laredo, J.L.J., Castillo, P.A., García-Valdez, J.-M., Rojas-Galeano, S.: Exploring concurrent and stateless evolutionary algorithms. In: Kaufmann, P., Castillo, P.A. (eds.) EvoApplications 2019. LNCS, vol. 11454, pp. 405–412. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-16692-2_27

    Chapter  Google Scholar 

  17. Pelta, D., Sancho-Royo, A., Cruz, C., Verdegay, J.L.: Using memory and fuzzy rules in a co-operative multi-thread strategy for optimization. Inf. Sci. 176(13), 1849–1868 (2006)

    Article  Google Scholar 

  18. Reece, J.B., Urry, L.A., Cain, M.L., Wasserman, S.A., Minorsky, P.V., Jackson, R.B., et al.: Campbell Biology, no. 1309. Pearson, Boston (2014)

    Google Scholar 

Download references

Acknowledgements

We are grateful to Jonathan Worthington and the rest of the Edument team for their disposition to help with implementation problems and provide suggestions to make this work correctly. This is extended to the rest of the Raku development team, which is an excellent and technically knowledgeable community committed to creating a great language. This paper has been supported in part by projects DeepBio (TIN2017-85727-C4-2-P).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. J. Merelo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Merelo, J.J., Valdez, M.G., Rojas-Galeano, S. (2020). Testing the Intermediate Disturbance Hypothesis in Concurrent Evolutionary Algorithms. In: Figueroa-García, J.C., Garay-Rairán, F.S., Hernández-Pérez, G.J., Díaz-Gutierrez, Y. (eds) Applied Computer Sciences in Engineering. WEA 2020. Communications in Computer and Information Science, vol 1274. Springer, Cham. https://doi.org/10.1007/978-3-030-61834-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-61834-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-61833-9

  • Online ISBN: 978-3-030-61834-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics