Population Resizing Using Nonlinear Dynamics in an Ecology-Based Approach

  • Rafael Stubs Parpinelli
  • Heitor Silvério Lopes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7435)


It is well known that, in nature, populations are dynamic in space and time. This means that the size of populations oscillate across their habitats over time. This work uses the concepts of habitats, ecological relationships, ecological successions and population dynamics to build a cooperative search algorithm, named ECO. This work aims to explore the population sizing not as a parameter but as a dynamic process. The Artificial Bee Colony (ABC) was used in the experiments where benchmark mathematical functions were optimized. Results were compared with ABC running alone, with and without the use of population dynamics. The ECO algorithm with population dynamics performed better than the other approaches, possibly thanks to the ecological interactions (intra and inter-habitats) that enabled the co-evolution of populations and to a more natural survival selection mechanism by the use of population dynamics.


optimization cooperative search co-evolution habitats logistic chaos model ecology population dynamics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    de Castro, L.N.: Fundamentals of natural computing: an overview. Physics of Life Reviews 4(1), 1–36 (2007)CrossRefGoogle Scholar
  2. 2.
    Engelbrecht, A.P.: Computational Intelligence: An Introduction, 2nd edn. Wiley, Chichester (2007)Google Scholar
  3. 3.
    Parpinelli, R.S., Lopes, H.S.: New inspirations in swarm intelligence: a survey. International Journal of Bio-Inspired Computation 3(1), 1–16 (2011)CrossRefGoogle Scholar
  4. 4.
    Begon, M., Townsend, C.R., Harper, J.L.: Ecology: from individuals to ecosystems, 4th edn. Blackwell Publishing, Oxford (2006)Google Scholar
  5. 5.
    May, R.M.C., McLean, A.R.: Theoretical Ecology: Principles and Applications. Oxford University Press, Oxford (2007)zbMATHGoogle Scholar
  6. 6.
    Eiben, A., Smith, J.: Introduction to Evolutionary Computing. Springer, London (2003)zbMATHGoogle Scholar
  7. 7.
    Parpinelli, R.S., Lopes, H.S.: An eco-inspired evolutionary algorithm applied to numerical optimization. In: Proceedings of the Third World Congress on Nature and Biologically Inspired Computing, Salamanca, Spain, pp. 473–478 (2011)Google Scholar
  8. 8.
    Kaplan, D., Glass, L.: Understanding Nonlinear Dynamics. Springer, New York (1995)zbMATHCrossRefGoogle Scholar
  9. 9.
    Digalakis, J.G., Margaritis, K.G.: An experimental study of benchmarking functions for evolutionary algorithms. International Journal of Computer Mathematics 79(4), 403–416 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Karaboga, D., Akay, B.: A comparative study of artificial bee colony algorithm. Applied Mathematics and Computation 214, 108–132 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Ma, Z.S.: Ecological theatre for evolutionary computing play: some insights from population ecology and evolutionary ecology. International Journal of Bio-Inspired Computation 3(1), 31–55 (2011)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Rafael Stubs Parpinelli
    • 1
    • 2
  • Heitor Silvério Lopes
    • 2
  1. 1.Applied Cognitive Computing GroupSanta Catarina State UniversityJoinvilleBrazil
  2. 2.Bioinformatics LaboratoryFederal Technological University of ParanáCuritibaBrazil

Personalised recommendations