A Swarm Algorithm Inspired by the Collective Animal Behavior

  • Erik CuevasEmail author
  • Fernando Fausto
  • Adrián González
Part of the Intelligent Systems Reference Library book series (ISRL, volume 160)


In this chapter, a swarm algorithm for global optimization called the Collective Animal Behavior (CAB) is introduced. The algorithm is based on animal groups, such as schools of fish, flocks of birds, swarms of locusts, and herds of wildebeest, that exhibit a variety of behaviors including swarming about a food source, milling around a central location or migrating over large distances in aligned groups. These collective behaviors are often advantageous to groups, allowing them to increase their harvesting efficiency, to follow better migration routes, to improve their aerodynamic and to avoid predation. In the presented algorithm in this chapter, the searcher agents emulate a group of animals which interact to each other based on the biological laws of collective motion. The optimization method presented in this chapter has been compared to other well-known optimization algorithms. The results, experiments and practical examples confirm the high performance of the presented method to find a global optimum of several benchmark functions.


  1. 1.
    Pardalos Panos, M., Romeijn Edwin, H., Tuy, Hoang: Recent developments and trends in global optimization. J. Comput. Appl. Math. 124, 209–228 (2000)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Floudas, C., Akrotirianakis, I., Caratzoulas, S., Meyer, C., Kallrath, J.: Global optimization in the 21st century: advances and challenges. Comput. Chem. Eng. 29(6), 1185–1202 (2005)Google Scholar
  3. 3.
    Ying, J., Ke-Cun, Z., Shao-Jian, Q.: A deterministic global optimization algorithm. Appl. Math. Comput. 185(1), 382–387 (2007)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Georgieva, A., Jordanov, I.: Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms. Eur. J. Oper. Res. 196, 413–422 (2009)zbMATHGoogle Scholar
  5. 5.
    Lera, D., Y, Sergeyev: Lipschitz and Hölder global optimization using space-filling curves. Appl. Nume. Math. 60(1–2), 115–129 (2010)zbMATHGoogle Scholar
  6. 6.
    Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial intelligence through simulated evolution. Wiley, Chichester, UK (1966)zbMATHGoogle Scholar
  7. 7.
    De Jong, K.: Analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, Ann Arbor, MI (1975)Google Scholar
  8. 8.
    Koza, J.R.: Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems. Report no. STAN-CS-90-1314. Stanford University, CA (1990)Google Scholar
  9. 9.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI (1975)Google Scholar
  10. 10.
    Goldberg, D.E.: Genetic algorithms in search. In: Optimization and Machine Learning, Addison Wesley, Boston, MA (1989)Google Scholar
  11. 11.
    de Castro, L.N., Von Zuben F.J., Artificial immune systems: Part I—basic theory and applications. Technical report TR-DCA 01/99 (Dec 1999)Google Scholar
  12. 12.
    Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)MathSciNetzbMATHGoogle Scholar
  13. 13.
    İlker, B., Birbil, S., Shu-Cherng, F.: An electromagnetism-like mechanism for global optimization. J. Glob. Optim. 25, 263–282 (2003)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Rashedia, E., Nezamabadi-pour, H., Saryazdi, S.: Filter modeling using gravitational search algorithm. Eng. Appl. Artif. Intell. 24(1), 117–122 (2011)Google Scholar
  15. 15.
    Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)Google Scholar
  16. 16.
    Lee, K.S., Geem, Z.W.: A new meta-heuristic algorithm for continues engineering optimization: harmony search theory and practice. Comput. Methods Appl. Mech. Eng. 194, 3902–3933 (2004)zbMATHGoogle Scholar
  17. 17.
    Zong Woo Geem: Novel derivative of harmony search algorithm for discrete design variables. Appl. Math. Comput. 199, 223–230 (2008)MathSciNetzbMATHGoogle Scholar
  18. 18.
    Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)Google Scholar
  19. 19.
    Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical report no. 91-016. Politecnico di Milano (1991)Google Scholar
  20. 20.
    Oftadeh, R., Mahjoob, M.J., Shariatpanahi, M.: A novel meta-heuristic optimization algorithm inspired by group hunting of animals: Hunting search. Comput. Math Appl. 60, 2087–2098 (2010)zbMATHGoogle Scholar
  21. 21.
    Sumper, D.: The principles of collective animal behaviour. Philos. Trans. R. Soc. Lond. B Biol. Sci. 361(1465), 5–22 (2006)Google Scholar
  22. 22.
    Petit, O., Bon, R.: Decision-making processes: The case of collective movements. Behav. Proc. 84, 635–647 (2010)Google Scholar
  23. 23.
    Kolpas, A., Moehlis, J., Frewen, T., Kevrekidis, I.: Coarse analysis of collective motion with different communication mechanisms. Math. Biosci. 214, 49–57 (2008)MathSciNetzbMATHGoogle Scholar
  24. 24.
    Couzin, I.: Collective cognition in animal groups. Trends Cogn. Sci. 13(1), 36–43 (2008)Google Scholar
  25. 25.
    Couzin, I.D., Krause, J.: Self-organization and collective behavior in vertebrates. Adv. Stud. Behav. 32, 1–75 (2003)Google Scholar
  26. 26.
    Bode, N., Franks, D., Wood, A.: Making noise: emergent stochasticity in collective motion. J. Theor. Biol. 267, 292–299 (2010)MathSciNetzbMATHGoogle Scholar
  27. 27.
    Couzi, I., Krause, I., James, R., Ruxton, G., Franks, N.: Collective memory and spatial sorting in animal groups. J. Theor. Biol. 218, 1–11 (2002)MathSciNetGoogle Scholar
  28. 28.
    Couzin, I.D.: Collective minds. Nature 445, 715–728 (2007)Google Scholar
  29. 29.
    Bazazi, S., Buhl, J., Hale, J.J., Anstey, M.L., Sword, G.A., Simpson, S.J., Couzin, I.D.: Collective motion and cannibalism in locust migratory bands. Curr. Biol. 18, 735–739 (2008)Google Scholar
  30. 30.
    Bode, N., Wood, A., Franks, D.: The impact of social networks on animal collective motion. Anim. Behav. 82(1), 29–38 (2011)Google Scholar
  31. 31.
    Lemasson, B., Anderson, J., Goodwin, R.: Collective motion in animal groups from a neurobiological perspective: the adaptive benefits of dynamic sensory loads and selective attention. J. Theor. Biol. 261(4), 501–510 (2009)MathSciNetzbMATHGoogle Scholar
  32. 32.
    Bourjade, M., Thierry, B., Maumy, M., Petit, O.: Decision-making processes in the collective movements of Przewalski horses families Equus ferus Przewalskii: influences of the environment. Ethology 115, 321–330 (2009)Google Scholar
  33. 33.
    Banga, A., Deshpande, S., Sumanab, A., Gadagkar, R.: Choosing an appropriate index to construct dominance hierarchies in animal societies: a comparison of three indices. Anim. Behav. 79(3), 631–636 (2010)Google Scholar
  34. 34.
    Hsu, Y., Earley, R., Wolf, L.: Modulation of aggressive behaviour by fighting experience: mechanisms and contest outcomes. Biol. Rev. 81(1), 33–74 (2006)Google Scholar
  35. 35.
    Broom, M., Koenig, A., Borries, C.: Variation in dominance hierarchies among group-living animals: modeling stability and the likelihood of coalitions. Behav. Ecol. 20, 844–855 (2009)Google Scholar
  36. 36.
    Bayly, K.L., Evans, C.S., Taylor, A.: Measuring social structure: a comparison of eight dominance indices. Behav. Proc. 73, 1–12 (2006)Google Scholar
  37. 37.
    Conradt, L., Roper, T.J.: Consensus decision-making in animals. Trends Ecol. Evol. 20, 449–456 (2005)Google Scholar
  38. 38.
    Okubo, A.: Dynamical aspects of animal grouping. Adv. Biophys. 22, 1–94 (1986)Google Scholar
  39. 39.
    Reynolds, C.W.: Flocks, herds and schools: a distributed behavioural model. Comp. Graph. 21, 25–33 (1987)Google Scholar
  40. 40.
    Gueron, S., Levin, S.A., Rubenstein, D.I.: The dynamics of mammalian herds: from individual to aggregations. J. Theor. Biol. 182, 85–98 (1996)Google Scholar
  41. 41.
    Czirok, A., Vicsek, T.: Collective behavior of interacting self-propelled particles. Phys. A 281, 17–29 (2000)Google Scholar
  42. 42.
    Ballerini, M.: Interaction ruling collective animal behavior depends on topological rather than metric distance: evidence from a field study. Proc. Natl. Acad. Sci. U.S.A. 105, 1232–1237 (2008)Google Scholar
  43. 43.
    Ali, M.M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Glob. Optim. 31(4), 635–672 (2005)MathSciNetzbMATHGoogle Scholar
  44. 44.
    Chelouah, R., Siarry, P.: A continuous genetic algorithm designed for the global optimization of multimodal functions. J. Heuristics 6(2), 191–213 (2000)zbMATHGoogle Scholar
  45. 45.
    Herrera, F., Lozano, M., Sánchez, A.M.: A taxonomy for the crossover operator for real-coded genetic algorithms: an experimental study. Int. J. Intell. Syst. 18(3), 309–338 (2003)zbMATHGoogle Scholar
  46. 46.
    Laguna, M., Martí, R.: Experimental testing of advanced scatter search designs for global optimization of multimodal functions. J. Global Optim. 33(2), 235–255 (2005)MathSciNetzbMATHGoogle Scholar
  47. 47.
    Lozano, M., Herrera, F., Krasnogor, N., Molina, D.: Real-coded memetic algorithms with crossover hill-climbing. Evol. Comput. 12(3), 273–302 (2004)Google Scholar
  48. 48.
    Moré, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17–41 (1981)MathSciNetzbMATHGoogle Scholar
  49. 49.
    Ortiz-Boyer, D., Hervás-Martınez, C., García-Pedrajas, N.: CIXL2: a crossover operator for evolutionary algorithms based on population features. J. Artif. Intell. Res. 24(1), 1–48 (2005)zbMATHGoogle Scholar
  50. 50.
    Price, K., Storn, R.M., Lampinen, J.A.: Differential evolution: a practical approach to global optimization. Springer, New York (2005)zbMATHGoogle Scholar
  51. 51.
    Rahnamayan, S., Tizhoosh, H.R., Salama, M.M.A.: Opposition-based differential evolution. IEEE Trans. Evol. Comput. 12(1), 64–79 (2008)Google Scholar
  52. 52.
    Whitley, D., Rana, D., Dzubera, J., Mathias, E.: Evaluating evolutionary algorithms. Artif. Intell. 85(1–2), 245–276 (1996)Google Scholar
  53. 53.
    Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82–102 (1999)Google Scholar
  54. 54.
    Hamzaçebi, C.: Improving genetic algorithms’ performance by local search for continuous function optimization. Appl. Math. Comput. 196(1), 309–317 (2008)zbMATHGoogle Scholar
  55. 55.
    Rashedi, E., Nezamabadi-pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179, 2232–2248 (2009)zbMATHGoogle Scholar
  56. 56.
    Storn, R., Price, K.: Differential evolution—a simple and efficient adaptive scheme for global optimisation over continuous spaces. Technical report TR-95–012. ICSI, Berkeley, CA (1995)Google Scholar
  57. 57.
    Shilane, D., Martikainen, J., Dudoit, S., Ovaska, S.: A general framework for statistical performance comparison of evolutionary computation algorithms. Inf. Sci. 178, 2870–2879 (2008)Google Scholar
  58. 58.
    Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics 1, 80–83 (1945)MathSciNetGoogle Scholar
  59. 59.
    Garcia, S., Molina, D., Lozano, M., Herrera, F.: A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special session on real parameter optimization. J. Heurist. (2008).
  60. 60.
    Al-Baali, M.: On the behavior of bombined extra-updating/self scaling BFGS method. J. Comput. Appl. Math. 134, 269–281 (2001)MathSciNetzbMATHGoogle Scholar
  61. 61.
    Powell, M.: How bad are the BFGS and DFP methods when the objective function is quadratic? Math. Program. 34, 34–37 (1986)MathSciNetzbMATHGoogle Scholar
  62. 62.
    Hansen, E., Walster, G.: Global Optimization Using Interval Analysis. CRC Press (2004)Google Scholar
  63. 63.
    Lasdona, L., Plummer, J.: Multistart algorithms for seeking feasibility. Comput. Oper. Res. 35(5), 1379–1393 (2008)MathSciNetzbMATHGoogle Scholar
  64. 64.
    Theos, F., Lagaris, I., Papageorgiou, D.: PANMIN: sequential and parallel global optimization procedures with a variety of options for the local search strategy. Comput. Phys. Commun. 159, 63–69 (2004)Google Scholar
  65. 65.
    Voglis, C., Lagaris, I.: Towards ‘‘Ideal Multistart”. A stochastic approach for locating the minima of a continuous function inside a bounded domain. Appl. Math. Comput. 213, 216–229 (2009)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Erik Cuevas
    • 1
    Email author
  • Fernando Fausto
    • 2
  • Adrián González
    • 3
  1. 1.CUCEI, Universidad de GuadalajaraGuadalajaraMexico
  2. 2.CUCEI, Universidad de GuadalajaraGuadalajaraMexico
  3. 3.CUCEI, Universidad de GuadalajaraGuadalajaraMexico

Personalised recommendations