• Babak Zolghadr-Asli
  • Omid Bozorg-Haddad
  • Xuefeng Chu
Part of the Studies in Computational Intelligence book series (SCI, volume 720)


In this chapter, some general knowledge relative to the realm of nature-inspired optimization algorithms (NIOA) is introduced. The desirable merits of these intelligent algorithms and their initial successes in many fields have inspired researchers to continuously develop such revolutionary algorithms and implement them to solve various real-world problems. Such a truly interdisciplinary environment of the research and development provides rewarding opportunities for scientific breakthrough and technology innovation. After a brief introduction to computational intelligence and its application in optimization problems, the history of the NIOA was reviewed. The relevant algorithms were then categorized in different manners. Finally, one the most groundbreaking theorems regarding the nature-inspired optimization techniques was briefly discussed.


  1. Back, T., Hammel, U., & Schwefel, H. P. (1997). Evolutionary computation: Comments on the history and current state. IEEE Transactions on Evolutionary Computation, 1(1), 3–17.Google Scholar
  2. Bezdek, J. C. (1992). On the relationship between neural networks, pattern recognition and intelligence. International Journal of Approximate Reasoning, 6(2), 85–107.Google Scholar
  3. Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR), 35(3), 268–308.Google Scholar
  4. Dorigo, M., & Blum, C. (2005). Ant colony optimization theory: A survey. Theoretical Computer Science, 344(2–3), 243–278.MathSciNetMATHGoogle Scholar
  5. Du, K. L., & Swamy, M. N. S. (2016). Search and optimization by metaheuristics. Switzerland: Springer Publication.MATHGoogle Scholar
  6. Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966). Intelligent decision making through a simulation of evolution. Behavioral Science, 11(4), 253–272.Google Scholar
  7. Goldberg, D. E., & Holland, J. H. (1988). Genetic algorithms and machine learning. Machine Learning, 3(2), 95–99.Google Scholar
  8. Poli, R., Kennedy, J., & Blackwell, T. (2007). Particle swarm optimization. Swarm Intelligence, 1(1), 33–57.Google Scholar
  9. Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67–82.Google Scholar
  10. Xing, B., & Gao, W. J. (2014). Innovative computational intelligence: A rough guide to 134 clever algorithms. Cham, Switzerland: Springer Publication.MATHGoogle Scholar
  11. Yang, X. S. (2010). Nature-inspired metaheuristic algorithms. Frome, UK: Luniver Press.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Department of Irrigation and Reclamation Engineering, Faculty of Agricultural Engineering and Technology, College of Agriculture and Natural ResourcesUniversity of TehranKarajIran
  2. 2.Department of Civil and Environmental EngineeringNorth Dakota State UniversityFargoUSA

Personalised recommendations