Skip to main content
Erschienen in: The Journal of Supercomputing 5/2022

12.10.2021

A symbiosis of arithmetic optimizer with slime mould algorithm for improving global optimization and conventional design problem

verfasst von: Sumika Chauhan, Govind Vashishtha, Anil Kumar

Erschienen in: The Journal of Supercomputing | Ausgabe 5/2022

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

An arithmetic optimizer algorithm (AOA) is hybridized with slime mould algorithm (SMA) to address the issue of less internal memory and slow convergence at local minima which is termed as HAOASMA. Lens opposition-based learning strategy is also integrated with the hybrid algorithm which enhances the population diversity of the hybrid optimizer to accelerate the convergence. The local best (\(P_{{{\text{best}}}} )\) and global best (\(g_{{{\text{best}}}} )\) of SMA initializes the AOA’s search process. The \(P_{{{\text{best}}}}\) obtained from AOA again initializes the SMA to further exploit the search space. In this way, the developed hybrid algorithm utilizes the exploitation and exploration capabilities of SMA and AOA, respectively. The developed HAOASMA has been compared on twenty-three benchmark functions at different dimensions with basic SMA, AOA and six renowned meta-heuristic algorithms. The HAOASMA has also been applied to classical engineering design problems. The performance of HAOASMA is significantly superior compared to basic SMA, AOA and other meta-heuristic algorithms.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

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+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!

Literatur
1.
Zurück zum Zitat Gupta S, Deep K, Mirjalili S, Kim JH (2020) A modified sine cosine algorithm with novel transition parameter and mutation operator for global optimization. Expert Syst Appl 2020:113395CrossRef Gupta S, Deep K, Mirjalili S, Kim JH (2020) A modified sine cosine algorithm with novel transition parameter and mutation operator for global optimization. Expert Syst Appl 2020:113395CrossRef
2.
Zurück zum Zitat Talbi E-G (2009) Metaheuristics: from design to implementation, vol 74. John Wiley & Sons Talbi E-G (2009) Metaheuristics: from design to implementation, vol 74. John Wiley & Sons
3.
Zurück zum Zitat Michiels W, Aarts EHL, Korst JHM (2007) Theoretical aspects of local search. Springer, BerlinMATH Michiels W, Aarts EHL, Korst JHM (2007) Theoretical aspects of local search. Springer, BerlinMATH
4.
Zurück zum Zitat Glover F, Laguna M (1989) Tabu search-part I. ORSA J Comput 1(3):190–206CrossRef Glover F, Laguna M (1989) Tabu search-part I. ORSA J Comput 1(3):190–206CrossRef
5.
Zurück zum Zitat Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science (80-) 220(4598):671–680MathSciNetCrossRef Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science (80-) 220(4598):671–680MathSciNetCrossRef
7.
Zurück zum Zitat Goldberg DE (1989) Genetic algorithm in search. Dorling Kindersley Publishing Inc Person Education, London Goldberg DE (1989) Genetic algorithm in search. Dorling Kindersley Publishing Inc Person Education, London
8.
Zurück zum Zitat Vashishtha G, Kumar R (2021) An effective health indicator for Pelton wheel using Levy Flight mutated Genetic Algorithm. Meas Sci Technol 32:094003CrossRef Vashishtha G, Kumar R (2021) An effective health indicator for Pelton wheel using Levy Flight mutated Genetic Algorithm. Meas Sci Technol 32:094003CrossRef
9.
Zurück zum Zitat Chauhan S, Singh M, Aggarwal AK (2020) Diversity driven multi-parent evolutionary algorithm with adaptive non-uniform mutation. J Exp Theor Artif Intell 2020:1–32 Chauhan S, Singh M, Aggarwal AK (2020) Diversity driven multi-parent evolutionary algorithm with adaptive non-uniform mutation. J Exp Theor Artif Intell 2020:1–32
14.
Zurück zum Zitat Abualigah L, Diabat A (2021) Advances in sine cosine algorithm: a comprehensive survey, vol 54. Springer, Berlin Abualigah L, Diabat A (2021) Advances in sine cosine algorithm: a comprehensive survey, vol 54. Springer, Berlin
16.
Zurück zum Zitat Del Ser J (2014) The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems. Sci World J 2014:1–15CrossRef Del Ser J (2014) The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems. Sci World J 2014:1–15CrossRef
20.
30.
Zurück zum Zitat Yang X-S (2020) Firefly algorithm, stochastic test functions and design optimisation. Int J Bio-inspired Comput 2(2):1–12 Yang X-S (2020) Firefly algorithm, stochastic test functions and design optimisation. Int J Bio-inspired Comput 2(2):1–12
35.
Zurück zum Zitat Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. SIMULATION 76(2):60–68CrossRef Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. SIMULATION 76(2):60–68CrossRef
40.
Zurück zum Zitat Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: a new method for stochastic optimization. Future Gener Comput Syst 111:300–323CrossRef Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: a new method for stochastic optimization. Future Gener Comput Syst 111:300–323CrossRef
43.
Zurück zum Zitat Wolpert DH, William GM (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1.1:67–82CrossRef Wolpert DH, William GM (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1.1:67–82CrossRef
46.
49.
Zurück zum Zitat Wang Z, Luo Q, Zhou Y (2020) Hybrid metaheuristic algorithm using butterfly and flower pollination base on mutualism mechanism for global optimization problems, no. 0123456789. Springer, London Wang Z, Luo Q, Zhou Y (2020) Hybrid metaheuristic algorithm using butterfly and flower pollination base on mutualism mechanism for global optimization problems, no. 0123456789. Springer, London
Metadaten
Titel
A symbiosis of arithmetic optimizer with slime mould algorithm for improving global optimization and conventional design problem
verfasst von
Sumika Chauhan
Govind Vashishtha
Anil Kumar
Publikationsdatum
12.10.2021
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 5/2022
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-021-04105-8

Weitere Artikel der Ausgabe 5/2022

The Journal of Supercomputing 5/2022 Zur Ausgabe

Premium Partner