Skip to main content
Top
Published in: Neural Computing and Applications 8/2019

29-01-2018 | Original Article

Chaotic grasshopper optimization algorithm for global optimization

Authors: Sankalap Arora, Priyanka Anand

Published in: Neural Computing and Applications | Issue 8/2019

Log in

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

search-config
loading …

Abstract

Grasshopper optimization algorithm (GOA) is a new meta-heuristic algorithm inspired by the swarming behavior of grasshoppers. The present study introduces chaos theory into the optimization process of GOA so as to accelerate its global convergence speed. The chaotic maps are employed to balance the exploration and exploitation efficiently and the reduction in repulsion/attraction forces between grasshoppers in the optimization process. The proposed chaotic GOA algorithms are benchmarked on thirteen test functions. The results show that the chaotic maps (especially circle map) are able to significantly boost the performance of GOA.

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

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!

Literature
1.
go back to reference Yang X-S (2008) Introduction to mathematical optimization: from linear programming to metaheuristics. Cambridge International Science Publishing, CambridgeMATH Yang X-S (2008) Introduction to mathematical optimization: from linear programming to metaheuristics. Cambridge International Science Publishing, CambridgeMATH
2.
go back to reference Brownlee J (2011) Clever algorithms: nature-inspired programming recipes. 1st edn. Lulu, North Carolina Brownlee J (2011) Clever algorithms: nature-inspired programming recipes. 1st edn. Lulu, North Carolina
3.
go back to reference Yang X-S, Gandomi AH, Talatahari S, Alavi AH (eds) (2012) Metaheuristics in water, geotechnical and transport engineering. Elsevier, Newnes Yang X-S, Gandomi AH, Talatahari S, Alavi AH (eds) (2012) Metaheuristics in water, geotechnical and transport engineering. Elsevier, Newnes
4.
go back to reference Yildiz AR (2009) An effective hybrid immune-hill climbing optimization approach for solving design and manufacturing optimization problems in industry. J Mater Process Technol 209(6):2773–2780CrossRef Yildiz AR (2009) An effective hybrid immune-hill climbing optimization approach for solving design and manufacturing optimization problems in industry. J Mater Process Technol 209(6):2773–2780CrossRef
5.
go back to reference Jordehi AR (2015) Chaotic bat swarm optimisation (cbso). Appl Soft Comput 26:523–530CrossRef Jordehi AR (2015) Chaotic bat swarm optimisation (cbso). Appl Soft Comput 26:523–530CrossRef
6.
go back to reference Skalak DB (1994) Prototype and feature selection by sampling and random mutation hill climbing algorithms. In: Proceedings of the eleventh international conference on machine learning, pp 293–301 Skalak DB (1994) Prototype and feature selection by sampling and random mutation hill climbing algorithms. In: Proceedings of the eleventh international conference on machine learning, pp 293–301
7.
go back to reference Aarts E, Korst J (1988) Simulated annealing and Boltzmann machines. Wiley, New York Aarts E, Korst J (1988) Simulated annealing and Boltzmann machines. Wiley, New York
8.
go back to reference dos Coelho L Santos, Mariani VC (2006) Combining of chaotic differential evolution and quadratic programming for economic dispatch optimization with valve-point effect. IEEE Trans Power Syst 21(2):989CrossRef dos Coelho L Santos, Mariani VC (2006) Combining of chaotic differential evolution and quadratic programming for economic dispatch optimization with valve-point effect. IEEE Trans Power Syst 21(2):989CrossRef
9.
go back to reference Storn R (1996) Differential evolution design of an IIR filter. In: Proceedings of IEEE international conference on evolutionary computation, pp 268–273 Storn R (1996) Differential evolution design of an IIR filter. In: Proceedings of IEEE international conference on evolutionary computation, pp 268–273
10.
go back to reference Arora S, Singh S (2017) Node localization in wireless sensor networks using butterfly optimization algorithm. Arab J Sci Eng 42:3325–3335CrossRef Arora S, Singh S (2017) Node localization in wireless sensor networks using butterfly optimization algorithm. Arab J Sci Eng 42:3325–3335CrossRef
12.
go back to reference Ilonen J, Kamarainen J-K, Lampinen J (2003) Differential evolution training algorithm for feed-forward neural networks. Neural Process Lett 17(1):93–105CrossRef Ilonen J, Kamarainen J-K, Lampinen J (2003) Differential evolution training algorithm for feed-forward neural networks. Neural Process Lett 17(1):93–105CrossRef
13.
go back to reference Eberhart RC, Kennedy J et al (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, New York, vol 1, pp 39–43 Eberhart RC, Kennedy J et al (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, New York, vol 1, pp 39–43
14.
go back to reference Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning. Mach Learn 3(2):95–99CrossRef Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning. Mach Learn 3(2):95–99CrossRef
15.
go back to reference Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359MathSciNetMATHCrossRef Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359MathSciNetMATHCrossRef
16.
go back to reference Arora S, Singh S, Singh S, Sharma B (2014) Mutated firefly algorithm. In: International conference on parallel, distributed and grid computing (PDGC), pp 33–38 Arora S, Singh S, Singh S, Sharma B (2014) Mutated firefly algorithm. In: International conference on parallel, distributed and grid computing (PDGC), pp 33–38
17.
go back to reference Yang X-S (2010) Firefly algorithm, levy flights and global optimization. In: Research and development in intelligent systems XXVI, pp 209–218 Yang X-S (2010) Firefly algorithm, levy flights and global optimization. In: Research and development in intelligent systems XXVI, pp 209–218
18.
go back to reference Arora S, Singh S (2013) The firefly optimization algorithm: convergence analysis and parameter selection. Int J Comput Appl 69(3):48–52 Arora S, Singh S (2013) The firefly optimization algorithm: convergence analysis and parameter selection. Int J Comput Appl 69(3):48–52
19.
go back to reference Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) Gsa: a gravitational search algorithm. Inf Sci 179(13):2232–2248MATHCrossRef Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) Gsa: a gravitational search algorithm. Inf Sci 179(13):2232–2248MATHCrossRef
20.
go back to reference Geem ZW, Kim JH, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68CrossRef Geem ZW, Kim JH, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68CrossRef
21.
go back to reference Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evol Comput 9(2):159–195CrossRef Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evol Comput 9(2):159–195CrossRef
22.
go back to reference Arora S, Singh S (2015) Butterfly algorithm with levy flights for global optimization. In: International conference on signal processing, computing and control (ISPCC), pp 220–224 Arora S, Singh S (2015) Butterfly algorithm with levy flights for global optimization. In: International conference on signal processing, computing and control (ISPCC), pp 220–224
23.
go back to reference Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61CrossRef Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61CrossRef
24.
go back to reference Saremi S, Mirjalili S, Lewis A (2017) Grasshopper optimisation algorithm: theory and application. Adv Eng Softw 105:30–47CrossRef Saremi S, Mirjalili S, Lewis A (2017) Grasshopper optimisation algorithm: theory and application. Adv Eng Softw 105:30–47CrossRef
25.
go back to reference Yang D, Li G, Cheng G (2007) On the efficiency of chaos optimization algorithms for global optimization. Chaos Solitons Fractals 34(4):1366–1375MathSciNetCrossRef Yang D, Li G, Cheng G (2007) On the efficiency of chaos optimization algorithms for global optimization. Chaos Solitons Fractals 34(4):1366–1375MathSciNetCrossRef
26.
27.
go back to reference Gandomi AH, Yun GJ, Yang X-S, Talatahari S (2013) Chaos-enhanced accelerated particle swarm optimization. Commun Nonlinear Sci Numer Simul 18(2):327–340MathSciNetMATHCrossRef Gandomi AH, Yun GJ, Yang X-S, Talatahari S (2013) Chaos-enhanced accelerated particle swarm optimization. Commun Nonlinear Sci Numer Simul 18(2):327–340MathSciNetMATHCrossRef
28.
go back to reference Arora S, Singh S (2017) An improved butterfly optimization algorithm with chaos. J Intell Fuzzy Syst 32(1):1079–1088MATHCrossRef Arora S, Singh S (2017) An improved butterfly optimization algorithm with chaos. J Intell Fuzzy Syst 32(1):1079–1088MATHCrossRef
30.
go back to reference Han X, Chang X (2013) An intelligent noise reduction method for chaotic signals based on genetic algorithms and lifting wavelet transforms. Inf Sci 218:103–118CrossRef Han X, Chang X (2013) An intelligent noise reduction method for chaotic signals based on genetic algorithms and lifting wavelet transforms. Inf Sci 218:103–118CrossRef
31.
go back to reference Jordehi AR (2014) A chaotic-based big bang-big crunch algorithm for solving global optimisation problems. Neural Comput Appl 25(6):1329–1335CrossRef Jordehi AR (2014) A chaotic-based big bang-big crunch algorithm for solving global optimisation problems. Neural Comput Appl 25(6):1329–1335CrossRef
32.
go back to reference Jia D, Zheng G, Khan MK (2011) An effective memetic differential evolution algorithm based on chaotic local search. Inf Sci 181(15):3175–3187CrossRef Jia D, Zheng G, Khan MK (2011) An effective memetic differential evolution algorithm based on chaotic local search. Inf Sci 181(15):3175–3187CrossRef
33.
go back to reference Heidari AA, Abbaspour RA, Jordehi AR (2017) An efficient chaotic water cycle algorithm for optimization tasks. Neural Comput Appl 28(1):57–85CrossRef Heidari AA, Abbaspour RA, Jordehi AR (2017) An efficient chaotic water cycle algorithm for optimization tasks. Neural Comput Appl 28(1):57–85CrossRef
34.
go back to reference Talatahari S, Azar BF, Sheikholeslami R, Gandomi A (2012) Imperialist competitive algorithm combined with chaos for global optimization. Commun Nonlinear Sci Numer Simul 17(3):1312–1319MathSciNetMATHCrossRef Talatahari S, Azar BF, Sheikholeslami R, Gandomi A (2012) Imperialist competitive algorithm combined with chaos for global optimization. Commun Nonlinear Sci Numer Simul 17(3):1312–1319MathSciNetMATHCrossRef
35.
go back to reference Jordehi AR (2015) A chaotic artificial immune system optimisation algorithm for solving global continuous optimisation problems. Neural Comput Appl 26(4):827–833CrossRef Jordehi AR (2015) A chaotic artificial immune system optimisation algorithm for solving global continuous optimisation problems. Neural Comput Appl 26(4):827–833CrossRef
36.
go back to reference Chuang L-Y, Tsai S-W, Yang C-H (2011) Chaotic catfish particle swarm optimization for solving global numerical optimization problems. Appl Math Comput 217(16):6900–6916MathSciNetMATH Chuang L-Y, Tsai S-W, Yang C-H (2011) Chaotic catfish particle swarm optimization for solving global numerical optimization problems. Appl Math Comput 217(16):6900–6916MathSciNetMATH
37.
go back to reference Saremi S, Mirjalili S, Lewis A (2014) Biogeography-based optimisation with chaos. Neural Comput Appl 25(5):1077–1097CrossRef Saremi S, Mirjalili S, Lewis A (2014) Biogeography-based optimisation with chaos. Neural Comput Appl 25(5):1077–1097CrossRef
38.
go back to reference Han X, Chang X (2012) A chaotic digital secure communication based on a modified gravitational search algorithm filter. Inf Sci 208:14–27CrossRef Han X, Chang X (2012) A chaotic digital secure communication based on a modified gravitational search algorithm filter. Inf Sci 208:14–27CrossRef
39.
go back to reference Naanaa A (2015) Fast chaotic optimization algorithm based on spatiotemporal maps for global optimization. Appl Math Comput 269:402–411MathSciNetMATH Naanaa A (2015) Fast chaotic optimization algorithm based on spatiotemporal maps for global optimization. Appl Math Comput 269:402–411MathSciNetMATH
41.
go back to reference He D, He C, Jiang L-G, Zhu H-W, Hu G-R (2001) Chaotic characteristics of a one-dimensional iterative map with infinite collapses. IEEE Trans Circuits Syst I Fundam Theory Appl 48(7):900–906MathSciNetMATHCrossRef He D, He C, Jiang L-G, Zhu H-W, Hu G-R (2001) Chaotic characteristics of a one-dimensional iterative map with infinite collapses. IEEE Trans Circuits Syst I Fundam Theory Appl 48(7):900–906MathSciNetMATHCrossRef
42.
go back to reference Tavazoei MS, Haeri M (2007) Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithms. Appl Math Comput 187(2):1076–1085MathSciNetMATH Tavazoei MS, Haeri M (2007) Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithms. Appl Math Comput 187(2):1076–1085MathSciNetMATH
43.
go back to reference Zheng W-M (1994) Kneading plane of the circle map. Chaos Solitons Fractals 4(7):1221–1233MATHCrossRef Zheng W-M (1994) Kneading plane of the circle map. Chaos Solitons Fractals 4(7):1221–1233MATHCrossRef
45.
go back to reference Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102CrossRef Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102CrossRef
46.
go back to reference Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18CrossRef Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18CrossRef
47.
go back to reference García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the cec2005 special session on real parameter optimization. J Heuristics 15(6):617–644MATHCrossRef García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the cec2005 special session on real parameter optimization. J Heuristics 15(6):617–644MATHCrossRef
48.
go back to reference Wilcoxon F, Katti S, Wilcox RA (1970) Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test. Sel Tables Math Stat 1:171–259MATH Wilcoxon F, Katti S, Wilcox RA (1970) Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test. Sel Tables Math Stat 1:171–259MATH
Metadata
Title
Chaotic grasshopper optimization algorithm for global optimization
Authors
Sankalap Arora
Priyanka Anand
Publication date
29-01-2018
Publisher
Springer London
Published in
Neural Computing and Applications / Issue 8/2019
Print ISSN: 0941-0643
Electronic ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-018-3343-2

Other articles of this Issue 8/2019

Neural Computing and Applications 8/2019 Go to the issue

Premium Partner