Skip to main content
Top

2019 | OriginalPaper | Chapter

4. Mathematical Analysis of Algorithms: Part I

Authors : Xin-She Yang, Xing-Shi He

Published in: Mathematical Foundations of Nature-Inspired Algorithms

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

With the introduction of some of the major nature-inspired algorithms and the brief outline of mathematical foundations, now we are ready to analyse these algorithms in great detail. Obviously, we can analyse these algorithms from different angles and perspectives. Let us first analyse the basic components and mechanisms of most algorithms so as to gain some insights.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
6.
go back to reference Arara S, Barak B (2009) Computational complexity: a modern approach. Cambridge University Press, CambridgeCrossRef Arara S, Barak B (2009) Computational complexity: a modern approach. Cambridge University Press, CambridgeCrossRef
8.
go back to reference Ashby WA (1962) Principles of the self-organizing system. In: Von Foerster H, Zopf GW Jr (eds) Principles of self-organization: transactions of the University of Illinois Symposium. Pergamon Press, London, pp 255–278 Ashby WA (1962) Principles of the self-organizing system. In: Von Foerster H, Zopf GW Jr (eds) Principles of self-organization: transactions of the University of Illinois Symposium. Pergamon Press, London, pp 255–278
15.
go back to reference Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Survey 35(2):268–308CrossRef Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Survey 35(2):268–308CrossRef
24.
go back to reference Chen S, Peng G-H, He XS, Yang XS (2018) Global convergence analysis of the bat algorithm using a Markovian framework and dynamic system theory. Expert Syst Appl 114(1):173–182CrossRef Chen S, Peng G-H, He XS, Yang XS (2018) Global convergence analysis of the bat algorithm using a Markovian framework and dynamic system theory. Expert Syst Appl 114(1):173–182CrossRef
25.
go back to reference Clerc M, Kennedy J (2002) The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–73CrossRef Clerc M, Kennedy J (2002) The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–73CrossRef
34.
go back to reference Fisher L (2009) The perfect swarm: the science of complexity in everyday life. Basic Books, New York Fisher L (2009) The perfect swarm: the science of complexity in everyday life. Basic Books, New York
35.
go back to reference Fishman GS (1995) Monte Carlo: concepts, algorithms and applications. Springer, New YorkMATH Fishman GS (1995) Monte Carlo: concepts, algorithms and applications. Springer, New YorkMATH
43.
go back to reference Ghate A, Smith R (2008) Adaptive search with stochastic acceptance probabilities for global optimization. Oper Res Lett 36(3):285–290MathSciNetCrossRef Ghate A, Smith R (2008) Adaptive search with stochastic acceptance probabilities for global optimization. Oper Res Lett 36(3):285–290MathSciNetCrossRef
48.
go back to reference He XS, Yang XS, Karamanoglu M, Zhao YX (2017) Global convergence analysis of the flower pollination algorithm: a discrete-time Markov chain approach. Proc Comput Sci 108(1):1354–1363CrossRef He XS, Yang XS, Karamanoglu M, Zhao YX (2017) Global convergence analysis of the flower pollination algorithm: a discrete-time Markov chain approach. Proc Comput Sci 108(1):1354–1363CrossRef
53.
go back to reference Joyce T, Herrmann JM (2018) A review of no free lunch theorems, and their implications for metaheuristic optimisation. In: Yang XS (ed) Nature-inspired algorithms and applied optimization. Springer, Berlin, pp 27–52CrossRef Joyce T, Herrmann JM (2018) A review of no free lunch theorems, and their implications for metaheuristic optimisation. In: Yang XS (ed) Nature-inspired algorithms and applied optimization. Springer, Berlin, pp 27–52CrossRef
56.
go back to reference Keller EF (2009) Organisms, machines, and thunderstorms: a history of self-organization, Part two. Complexity, emergence, and stable attractors. Hist Stud Nat Sci 39(1):1–31CrossRef Keller EF (2009) Organisms, machines, and thunderstorms: a history of self-organization, Part two. Complexity, emergence, and stable attractors. Hist Stud Nat Sci 39(1):1–31CrossRef
79.
98.
go back to reference Süli E, Mayer D (2003) An introduction to numerical analysis. Cambridge University Press, CambridgeCrossRef Süli E, Mayer D (2003) An introduction to numerical analysis. Cambridge University Press, CambridgeCrossRef
99.
go back to reference Surowiecki J (2004) The wisdom of crowds. Doubleday, Anchor Surowiecki J (2004) The wisdom of crowds. Doubleday, Anchor
100.
go back to reference Suzuki JA (1995) A Markov chain analysis on simple genetic algorithms. IEEE Trans Syst Man Cybern 25(4):655–659 (1995)CrossRef Suzuki JA (1995) A Markov chain analysis on simple genetic algorithms. IEEE Trans Syst Man Cybern 25(4):655–659 (1995)CrossRef
105.
go back to reference Villalobos-Arias M, Colleo CAC, Hernández-Lerma O (2005) Asymptotic convergence of metaheuristics for multiobjective optimization problems. Soft Comput 10(11):1001–1005CrossRef Villalobos-Arias M, Colleo CAC, Hernández-Lerma O (2005) Asymptotic convergence of metaheuristics for multiobjective optimization problems. Soft Comput 10(11):1001–1005CrossRef
107.
go back to reference Wolpert DH, Macready WG (1997) No free lunch theorem for optimization. IEEE Trans Evol Comput 1(1):67–82CrossRef Wolpert DH, Macready WG (1997) No free lunch theorem for optimization. IEEE Trans Evol Comput 1(1):67–82CrossRef
108.
go back to reference Wolpert DH, Macready WG (2005) Coevolutionary free lunches. IEEE Trans Evol Comput 9(6):721–735CrossRef Wolpert DH, Macready WG (2005) Coevolutionary free lunches. IEEE Trans Evol Comput 9(6):721–735CrossRef
118.
go back to reference Yang XS (2014) Nature-inspired optimization algorithms. Elsevier Insight, LondonMATH Yang XS (2014) Nature-inspired optimization algorithms. Elsevier Insight, LondonMATH
Metadata
Title
Mathematical Analysis of Algorithms: Part I
Authors
Xin-She Yang
Xing-Shi He
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-030-16936-7_4