Skip to main content
Erschienen in: The Journal of Supercomputing 12/2020

26.02.2020

Efficient hybrid algorithm based on moth search and fireworks algorithm for solving numerical and constrained engineering optimization problems

verfasst von: Xiaoxia Han, Lin Yue, Yingchao Dong, Quanxi Xu, Gang Xie, Xinying Xu

Erschienen in: The Journal of Supercomputing | Ausgabe 12/2020

Einloggen

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

search-config
loading …

Abstract

The moth search algorithm (MS) is a novel intelligent optimization algorithm based on moth population behavior, which can solve many problems in different fields. However, the algorithm is easy to fall into local optimization when solving complex optimization problems. This study develops a new hybrid moth search-fireworks algorithm (MSFWA) to solve numerical and constrained engineering optimization problems. The explosion and mutation operators from the fireworks algorithm are introduced into the MS, which not only preserves the advantages of fast convergence and strong exploitation capability of the algorithm, but also significantly enhances the exploration capability. The performance of the MSFWA is tested using 23 benchmark functions. The hybrid algorithm is superior to other highly advanced metaheuristic algorithms for most benchmark functions, demonstrating the characteristics of fast convergence and high stability. Finally, the ability of the MSFWA to solve practical constrained problems is evaluated on six well-known engineering application problems. Compared with other optimization algorithms, the MSFWA is very competitive in its solution of these complex and constrained practical problems.

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 Khalilpourazari S, Khalilpourazary S (2018) Optimization of production time in the multi-pass milling process via a Robust Grey Wolf Optimizer. Neural Comput Appl 29(12):1321–1336 Khalilpourazari S, Khalilpourazary S (2018) Optimization of production time in the multi-pass milling process via a Robust Grey Wolf Optimizer. Neural Comput Appl 29(12):1321–1336
2.
Zurück zum Zitat Khalilpourazari S, Khalilpourazary S (2019) An efficient hybrid algorithm based on water cycle and moth-flame optimization algorithms for solving numerical and constrained engineering optimization problems. Soft Comput 23(5):1699–1722 Khalilpourazari S, Khalilpourazary S (2019) An efficient hybrid algorithm based on water cycle and moth-flame optimization algorithms for solving numerical and constrained engineering optimization problems. Soft Comput 23(5):1699–1722
3.
Zurück zum Zitat Xue Y, Jiang J, Zhao B, Ma T (2018) A self-adaptive artificial bee colony algorithm based on global best for global optimization. Soft Comput 22(9):2935–2952 Xue Y, Jiang J, Zhao B, Ma T (2018) A self-adaptive artificial bee colony algorithm based on global best for global optimization. Soft Comput 22(9):2935–2952
4.
Zurück zum Zitat Jain M, Singh V, Rani A (2019) A novel nature-inspired algorithm for optimization: Squirrel search algorithm. Swarm Evol Comput 44:148–175 Jain M, Singh V, Rani A (2019) A novel nature-inspired algorithm for optimization: Squirrel search algorithm. Swarm Evol Comput 44:148–175
5.
Zurück zum Zitat Luo Q, Yang X, Zhou Y (2019) Nature-inspired approach: an enhanced moth swarm algorithm for global optimization. Math Comput Simul 159:57–92MathSciNet Luo Q, Yang X, Zhou Y (2019) Nature-inspired approach: an enhanced moth swarm algorithm for global optimization. Math Comput Simul 159:57–92MathSciNet
6.
Zurück zum Zitat Chegini SN, Bagheri A, Najafi F (2018) PSOSCALF: a new hybrid PSO based on Sine Cosine Algorithm and Levy flight for solving optimization problems. Appl Soft Comput 73:697–726 Chegini SN, Bagheri A, Najafi F (2018) PSOSCALF: a new hybrid PSO based on Sine Cosine Algorithm and Levy flight for solving optimization problems. Appl Soft Comput 73:697–726
7.
Zurück zum Zitat Gharehchopogh FS, Gholizadeh H (2019) A comprehensive survey: whale optimization algorithm and its applications. Swarm Evol Comput 48:1–24 Gharehchopogh FS, Gholizadeh H (2019) A comprehensive survey: whale optimization algorithm and its applications. Swarm Evol Comput 48:1–24
8.
Zurück zum Zitat Coit DW (1998) Genetic algorithms and engineering design. Eng Econ 43(4):379–381 Coit DW (1998) Genetic algorithms and engineering design. Eng Econ 43(4):379–381
9.
Zurück zum Zitat Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359MathSciNetMATH Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359MathSciNetMATH
10.
Zurück zum Zitat Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: MHS’95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, IEEE, pp 39–43 Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: MHS’95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, IEEE, pp 39–43
11.
Zurück zum Zitat Sammut C, Webb GI (2011) Encyclopedia of machine learning. Springer, BerlinMATH Sammut C, Webb GI (2011) Encyclopedia of machine learning. Springer, BerlinMATH
12.
Zurück zum Zitat Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61 Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61
13.
Zurück zum Zitat Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680MathSciNetMATH Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680MathSciNetMATH
14.
Zurück zum Zitat Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inform Sci 179(13):2232–2248MATH Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inform Sci 179(13):2232–2248MATH
15.
Zurück zum Zitat Ali MZ, Awad NH, Suganthan PN, Duwairi RM, Reynolds RG (2016) A novel hybrid Cultural Algorithms framework with trajectory-based search for global numerical optimization. Inform Sci 334:219–249 Ali MZ, Awad NH, Suganthan PN, Duwairi RM, Reynolds RG (2016) A novel hybrid Cultural Algorithms framework with trajectory-based search for global numerical optimization. Inform Sci 334:219–249
16.
Zurück zum Zitat Khalilpourazari S, Pasandideh SHR (2016) Bi-objective optimization of multi-product EPQ model with backorders, rework process and random defective rate. In: 2016 12th International Conference on Industrial Engineering (ICIE), IEEE, pp 36–40 Khalilpourazari S, Pasandideh SHR (2016) Bi-objective optimization of multi-product EPQ model with backorders, rework process and random defective rate. In: 2016 12th International Conference on Industrial Engineering (ICIE), IEEE, pp 36–40
17.
Zurück zum Zitat Khalilpourazari S, Khalilpourazary S (2017) A lexicographic weighted Tchebycheff approach for multi-constrained multi-objective optimization of the surface grinding process. Eng Optim 49(5):878–895MathSciNet Khalilpourazari S, Khalilpourazary S (2017) A lexicographic weighted Tchebycheff approach for multi-constrained multi-objective optimization of the surface grinding process. Eng Optim 49(5):878–895MathSciNet
18.
Zurück zum Zitat Khalilpourazari S, Khalilpourazary S (2018) A Robust stochastic fractal search approach for optimization of the surface grinding process. Swarm Evol Comput 38:173–186 Khalilpourazari S, Khalilpourazary S (2018) A Robust stochastic fractal search approach for optimization of the surface grinding process. Swarm Evol Comput 38:173–186
19.
Zurück zum Zitat Mirjalili S, Hashim SZM (2010) A new hybrid PSOGSA algorithm for function optimization. In: 2010 International Conference on Computer and Information Application, IEEE, pp 374–377 Mirjalili S, Hashim SZM (2010) A new hybrid PSOGSA algorithm for function optimization. In: 2010 International Conference on Computer and Information Application, IEEE, pp 374–377
20.
Zurück zum Zitat Han X, Dong Y, Yue L, Xu Q (2019) State transition simulated annealing algorithm for discrete-continuous optimization problems. IEEE Access 7:44391–44403 Han X, Dong Y, Yue L, Xu Q (2019) State transition simulated annealing algorithm for discrete-continuous optimization problems. IEEE Access 7:44391–44403
21.
Zurück zum Zitat Wang GG (2018) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput 10(2):151–164 Wang GG (2018) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput 10(2):151–164
24.
Zurück zum Zitat Digalakis JG, Margaritis KG (2001) On benchmarking functions for genetic algorithms. Int J Comput Math 77(4):481–506MathSciNetMATH Digalakis JG, Margaritis KG (2001) On benchmarking functions for genetic algorithms. Int J Comput Math 77(4):481–506MathSciNetMATH
25.
Zurück zum Zitat Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89:228–249 Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89:228–249
26.
Zurück zum Zitat Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120–133 Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120–133
27.
Zurück zum Zitat Zareh-Desari B, Abaszadeh-Yakhforvazani M, Khalilpourazary S (2015) The effect of nanoparticle additives on lubrication performance in deep drawing process: evaluation of forming load, friction coefficient and surface quality. Int J Precis Eng Man 16(5):929–936 Zareh-Desari B, Abaszadeh-Yakhforvazani M, Khalilpourazary S (2015) The effect of nanoparticle additives on lubrication performance in deep drawing process: evaluation of forming load, friction coefficient and surface quality. Int J Precis Eng Man 16(5):929–936
28.
Zurück zum Zitat Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11–12):1245–1287MathSciNetMATH Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11–12):1245–1287MathSciNetMATH
29.
Zurück zum Zitat Gandomi AH (2014) Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 53(4):1168–1183 Gandomi AH (2014) Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 53(4):1168–1183
30.
Zurück zum Zitat Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des 112(2):223–229 Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des 112(2):223–229
31.
Zurück zum Zitat Kannan B, Kramer SN (1994) An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. J Mech Des 116(2):405–411 Kannan B, Kramer SN (1994) An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. J Mech Des 116(2):405–411
32.
Zurück zum Zitat Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inf 26:30–45 Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inf 26:30–45
33.
Zurück zum Zitat Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697 Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697
34.
Zurück zum Zitat Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13(5):2592–2612 Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13(5):2592–2612
35.
Zurück zum Zitat Mirjalili S, Mirjalili SM, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495–513 Mirjalili S, Mirjalili SM, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495–513
36.
Zurück zum Zitat Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98 Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98
37.
Zurück zum Zitat Gandomi AH, Yang XS, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput-Ger 29(1):17–35 Gandomi AH, Yang XS, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput-Ger 29(1):17–35
38.
Zurück zum Zitat Chickermane H, Gea H (1996) Structural optimization using a new local approximation method. Int J Numer Methods Eng 39(5):829–846MathSciNetMATH Chickermane H, Gea H (1996) Structural optimization using a new local approximation method. Int J Numer Methods Eng 39(5):829–846MathSciNetMATH
39.
Zurück zum Zitat Cheng MY, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112 Cheng MY, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112
40.
Zurück zum Zitat Belegundu AD, Arora JS (1985) A study of mathematical programming methods for structural optimization. Part I: theory. Int J Numer Methods Eng 21(9):1583–1599MATH Belegundu AD, Arora JS (1985) A study of mathematical programming methods for structural optimization. Part I: theory. Int J Numer Methods Eng 21(9):1583–1599MATH
41.
Zurück zum Zitat Li L, Huang Z, Liu F, Wu Q (2007) A heuristic particle swarm optimizer for optimization of pin connected structures. Comput Struct 85(7–8):340–349 Li L, Huang Z, Liu F, Wu Q (2007) A heuristic particle swarm optimizer for optimization of pin connected structures. Comput Struct 85(7–8):340–349
42.
Zurück zum Zitat Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67 Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67
43.
Zurück zum Zitat Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41(2):113–127 Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41(2):113–127
44.
Zurück zum Zitat He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20(1):89–99 He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20(1):89–99
45.
Zurück zum Zitat Ragsdell K, Phillips D (1976) Optimal design of a class of welded structures using geometric programming. J Eng Ind 98(3):1021–1025 Ragsdell K, Phillips D (1976) Optimal design of a class of welded structures using geometric programming. J Eng Ind 98(3):1021–1025
46.
Zurück zum Zitat Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Method Appl Mech Eng 186(2–4):311–338MATH Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Method Appl Mech Eng 186(2–4):311–338MATH
47.
Zurück zum Zitat Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Method Appl Mech Eng 194(36–38):3902–3933MATH Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Method Appl Mech Eng 194(36–38):3902–3933MATH
48.
Zurück zum Zitat Krohling RA, dos Santos Coelho L (2006) Coevolutionary particle swarm optimization using Gaussian distribution for solving constrained optimization problems. IEEE Trans Syst Man Cybern Part B 36(6):1407–1416 Krohling RA, dos Santos Coelho L (2006) Coevolutionary particle swarm optimization using Gaussian distribution for solving constrained optimization problems. IEEE Trans Syst Man Cybern Part B 36(6):1407–1416
49.
Zurück zum Zitat Kaveh A, Mahdavi V (2014) Colliding bodies optimization: a novel meta-heuristic method. Comput Struct 139:18–27 Kaveh A, Mahdavi V (2014) Colliding bodies optimization: a novel meta-heuristic method. Comput Struct 139:18–27
50.
Zurück zum Zitat Wang GG (2003) Adaptive response surface method using inherited latin hypercube design points. J Mech Des 125(2):210–220 Wang GG (2003) Adaptive response surface method using inherited latin hypercube design points. J Mech Des 125(2):210–220
51.
Zurück zum Zitat Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043–3074 Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043–3074
52.
Zurück zum Zitat Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10(2):629–640 Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10(2):629–640
Metadaten
Titel
Efficient hybrid algorithm based on moth search and fireworks algorithm for solving numerical and constrained engineering optimization problems
verfasst von
Xiaoxia Han
Lin Yue
Yingchao Dong
Quanxi Xu
Gang Xie
Xinying Xu
Publikationsdatum
26.02.2020
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 12/2020
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-020-03212-2

Weitere Artikel der Ausgabe 12/2020

The Journal of Supercomputing 12/2020 Zur Ausgabe

Premium Partner