[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

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

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. 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

    Google Scholar 

  2. 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

    Google Scholar 

  3. 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

    Google Scholar 

  4. Jain M, Singh V, Rani A (2019) A novel nature-inspired algorithm for optimization: Squirrel search algorithm. Swarm Evol Comput 44:148–175

    Google Scholar 

  5. Luo Q, Yang X, Zhou Y (2019) Nature-inspired approach: an enhanced moth swarm algorithm for global optimization. Math Comput Simul 159:57–92

    MathSciNet  Google Scholar 

  6. 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

    Google Scholar 

  7. Gharehchopogh FS, Gholizadeh H (2019) A comprehensive survey: whale optimization algorithm and its applications. Swarm Evol Comput 48:1–24

    Google Scholar 

  8. Coit DW (1998) Genetic algorithms and engineering design. Eng Econ 43(4):379–381

    Google Scholar 

  9. Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359

    MathSciNet  MATH  Google Scholar 

  10. 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. Sammut C, Webb GI (2011) Encyclopedia of machine learning. Springer, Berlin

    MATH  Google Scholar 

  12. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61

    Google Scholar 

  13. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    MathSciNet  MATH  Google Scholar 

  14. Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inform Sci 179(13):2232–2248

    MATH  Google Scholar 

  15. 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

    Google Scholar 

  16. 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. 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–895

    MathSciNet  Google Scholar 

  18. Khalilpourazari S, Khalilpourazary S (2018) A Robust stochastic fractal search approach for optimization of the surface grinding process. Swarm Evol Comput 38:173–186

    Google Scholar 

  19. 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. Han X, Dong Y, Yue L, Xu Q (2019) State transition simulated annealing algorithm for discrete-continuous optimization problems. IEEE Access 7:44391–44403

    Google Scholar 

  21. Wang GG (2018) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput 10(2):151–164

    Google Scholar 

  22. Tan Y, Zhu Y (2010) Fireworks algorithm for optimization. In: Tan Y, Shi Y, Tan KC (eds) Advances in Swarm Intelligence, vol 6145. Springer, Berlin, pp 355–364. https://doi.org/10.1007/978-3-642-13495-1_44

    Chapter  Google Scholar 

  23. Chen S, Liu Y, Wei L, Guan B (2018) PS-FW: a hybrid algorithm based on particle swarm and fireworks for global optimization. Comput Intell Neurosci 2018:6094685. https://doi.org/10.1155/2018/6094685

    Article  Google Scholar 

  24. Digalakis JG, Margaritis KG (2001) On benchmarking functions for genetic algorithms. Int J Comput Math 77(4):481–506

    MathSciNet  MATH  Google Scholar 

  25. Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89:228–249

    Google Scholar 

  26. Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120–133

    Google Scholar 

  27. 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

    Google Scholar 

  28. 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–1287

    MathSciNet  MATH  Google Scholar 

  29. Gandomi AH (2014) Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 53(4):1168–1183

    Google Scholar 

  30. Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des 112(2):223–229

    Google Scholar 

  31. 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

    Google Scholar 

  32. Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inf 26:30–45

    Google Scholar 

  33. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697

    Google Scholar 

  34. 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

    Google Scholar 

  35. Mirjalili S, Mirjalili SM, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495–513

    Google Scholar 

  36. Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98

    Google Scholar 

  37. 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

    Google Scholar 

  38. Chickermane H, Gea H (1996) Structural optimization using a new local approximation method. Int J Numer Methods Eng 39(5):829–846

    MathSciNet  MATH  Google Scholar 

  39. Cheng MY, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112

    Google Scholar 

  40. 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–1599

    MATH  Google Scholar 

  41. 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

    Google Scholar 

  42. Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67

    Google Scholar 

  43. Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41(2):113–127

    Google Scholar 

  44. 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

    Google Scholar 

  45. Ragsdell K, Phillips D (1976) Optimal design of a class of welded structures using geometric programming. J Eng Ind 98(3):1021–1025

    Google Scholar 

  46. Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Method Appl Mech Eng 186(2–4):311–338

    MATH  Google Scholar 

  47. 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–3933

    MATH  Google Scholar 

  48. 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

    Google Scholar 

  49. Kaveh A, Mahdavi V (2014) Colliding bodies optimization: a novel meta-heuristic method. Comput Struct 139:18–27

    Google Scholar 

  50. Wang GG (2003) Adaptive response surface method using inherited latin hypercube design points. J Mech Des 125(2):210–220

    Google Scholar 

  51. Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043–3074

    Google Scholar 

  52. 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

    Google Scholar 

Download references

Acknowledgements

This work has been supported by a grant from the National Natural Science Foundation of China (21606159) and the Key Research and Development Program of Shanxi Province (201803D121039).

Author information

Authors and Affiliations

  1. College of Electrical and Power Engineering, Department of Automation, Taiyuan University of Technology, No. 79 Yingze West Street, Taiyuan, 030024, Shanxi, China

    Xiaoxia Han, Lin Yue, Yingchao Dong, Quanxi Xu, Gang Xie & Xinying Xu

  2. School of Electronic and Information Engineering, Taiyuan University of Science and Technology, Taiyuan, 030024, Shanxi, China

    Gang Xie

Authors
  1. Xiaoxia Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lin Yue
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yingchao Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Quanxi Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Gang Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Xinying Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoxia Han.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Han, X., Yue, L., Dong, Y. et al. Efficient hybrid algorithm based on moth search and fireworks algorithm for solving numerical and constrained engineering optimization problems. J Supercomput 76, 9404–9429 (2020). https://doi.org/10.1007/s11227-020-03212-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-020-03212-2

Keywords

Search

Navigation