Skip to main content

Advertisement

Springer Nature Link
Log in

An improved Henry gas solubility optimization for optimization tasks

  • Published:
Applied Intelligence Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The henry gas solubility optimization (HGSO) is a new nature-inspired algorithm that mimics Henry Gas Solubility to solve global optimization problems. The main changes of premature convergence and poor balance between exploration and exploitation persist, which cannot yet do well in solving some complex optimization problems. To solve the above problems and get better performance, and improved henry gas solubility optimization with dynamic opposite learning, sine cosine factor, conversion probability and interval contraction strategy is proposed in this paper. Firstly, to increase population diversity, using the asymmetry of the dynamic-opposite learning search space to enable individuals to traverse the entire solution space as much as possible. Secondly, change the position update method of henry gas solubility optimization and combine the sine and cosine strategies to better balance the exploration and exploitation of the algorithm. Thirdly, the interval shrinking strategy makes the algorithm better approach the optimal solution and accelerates the algorithm convergence. Finally, the well-known CEC2017 benchmark functions and three real-world engineering design problems were employed to demonstrate the performance of our algorithm. The diversity of algorithms and the coordination of different strategies are analyzed. The experimental results and statistical analyses show that the performance of our algorithm is better than the comparison algorithms.

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
$34.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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Li X, Zhang J, Yin M (2014) Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Comput Appl 24(7-8):1867–1877

    Article  Google Scholar 

  2. Hoseini Shekarabi SA, Gharaei A, Karimi M (2019) Modelling and optimal lot-sizing of integrated multi-level multi-wholesaler supply chains under the shortage and limited warehouse space: generalised outer approximation. Int J Syst Sci Oper Logist 6(3):237–257

    Google Scholar 

  3. Rabbani M, Hosseini-Mokhallesun SAA, Ordibazar AH, Farrokhi-Asl H (2020) A hybrid robust possibilistic approach for a sustainable supply chain location-allocation network design. Int J Syst Sci Oper Logist 7(1):60–75

    Google Scholar 

  4. Zhang X, Yu T, Yang B, Cheng L (2017) Accelerating bio-inspired optimizer with transfer reinforcement learning for reactive power optimization. Knowl-Based Syst 116:26–38

    Article  Google Scholar 

  5. Sayyadi R, Awasthi A (2018) A simulation-based optimisation approach for identifying key determinants for sustainable transportation planning. Int J Syst Sci Oper Logist 5(2):161–174

    Google Scholar 

  6. Yang Z, Li K, Guo Y, Ma H, Zheng M (2018) Compact real-valued teaching-learning based optimization with the applications to neural network training. Knowl-Based Syst 159:51–62

    Article  Google Scholar 

  7. Duan C, Deng C, Gharaei A, Wu J, Wang B (2018) Selective maintenance scheduling under stochastic maintenance quality with multiple maintenance actions. Int J Prod Res 56(23):7160–7178

    Article  Google Scholar 

  8. Sergeyev YD, Kvasov D, Mukhametzhanov M (2018) On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget. Sci Rep 8(1):1–9

    Article  Google Scholar 

  9. Sergeyev YD, Kvasov DE (2017) Deterministic global optimization: An introduction to the diagonal approach. Springer, New York

    Book  MATH  Google Scholar 

  10. Sergeyev YD, Strongin RG, Lera D (2013) Introduction to global optimization exploiting space-filling curves. Springer Science & Business Media, New York

    Book  MATH  Google Scholar 

  11. Gharaei A, Hoseini Shekarabi SA, Karimi M (2020) Modelling and optimal lot-sizing of the replenishments in constrained, multi-product and bi-objective epq models with defective products: Generalised cross decomposition. Int J Syst Sci Oper Logist 7(3):262–274

    Google Scholar 

  12. Gharaei A, Karimi M, Shekarabi SAH (2019) An integrated multi-product, multi-buyer supply chain under penalty, green, and quality control polices and a vendor managed inventory with consignment stock agreement: The outer approximation with equality relaxation and augmented penalty algorithm. Appl Math Model 69:223–254

    Article  MathSciNet  MATH  Google Scholar 

  13. Gharaei A, Karimi M, Hoseini Shekarabi SA (2019) Joint economic lot-sizing in multi-product multi-level integrated supply chains: Generalized benders decomposition. Int J Syst Sci Oper Logist, pp 1–17

  14. Goldberg DE (2006) Genetic algorithms. Pearson Education India

  15. Guo L, Meng Z, Sun Y, Wang L (2016) Parameter identification and sensitivity analysis of solar cell models with cat swarm optimization algorithm. Energy Convers Manag 108:520– 528

    Article  Google Scholar 

  16. Das S, Suganthan PN (2010) Differential evolution: A survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4–31

    Article  Google Scholar 

  17. Roshani A, Roshani A, Roshani A, Salehi M, Esfandyari A (2013) A simulated annealing algorithm for multi-manned assembly line balancing problem. J Manuf Syst 32(1):238–247

    Article  Google Scholar 

  18. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Glob Optim 39(3):459–471

    Article  MathSciNet  MATH  Google Scholar 

  19. Baruah RD, Angelov P (2013) Dec: Dynamically evolving clustering and its application to structure identification of evolving fuzzy models. IEEE Trans Cybern 44(9):1619–1631

    Article  Google Scholar 

  20. Jin Y (2005) A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput 9(1):3–12

    Article  Google Scholar 

  21. Duan H, Li P (2014) Bio-inspired computation in unmanned aerial vehicles. Springer, New York

    Book  Google Scholar 

  22. Kayabekir AE, Bekdaş G, Nigdeli SM, Yang X -S (2018) A comprehensive review of the flower pollination algorithm for solving engineering problems. In: Nature-inspired algorithms and applied optimization. Springer, pp 171–188

  23. Serdio F, Lughofer E, Zavoianu A-C, Pichler K, Pichler M, Buchegger T, Efendic H (2017) Improved fault detection employing hybrid memetic fuzzy modeling and adaptive filters. Appl Soft Comput 51:60–82

    Article  Google Scholar 

  24. Yang S (2015) Evolutionary computation for dynamic optimization problems. In: Proceedings of the companion publication of the 2015 annual conference on genetic and evolutionary computation, pp 629–649

  25. Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory, in MHS’95. In: Proceedings of the Sixth international symposium on micro machine and human science. IEEE, pp 39–43

  26. Lin A, Sun W, Yu H, Wu G, Tang H (2019) Adaptive comprehensive learning particle swarm optimization with cooperative archive. Appl Soft Comput 77:533–546

    Article  Google Scholar 

  27. Sonmez M (2011) Artificial bee colony algorithm for optimization of truss structures. Appl Soft Comput 11(2):2406–2418

    Article  Google Scholar 

  28. Civicioglu P, Besdok E (2013) A conceptual comparison of the cuckoo-search, particle swarm optimization, differential evolution and artificial bee colony algorithms. Artif Intell Rev 39(4):315–346

    Article  Google Scholar 

  29. Askari Q, Saeed M, Younas I (2020) Heap-based optimizer inspired by corporate rank hierarchy for global optimization. Expert Syst Appl 161:113702

    Article  Google Scholar 

  30. Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: A new method for stochastic optimization, Futur Gener Comput Syst

  31. Salgotra R, Singh U (2019) The naked mole-rat algorithm. Neural Comput Appl 31 (12):8837–8857

    Article  Google Scholar 

  32. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82

    Article  Google Scholar 

  33. Hashim FA, Houssein EH, Mabrouk MS, Al-Atabany W, Mirjalili S (2019) Henry gas solubility optimization: A novel physics-based algorithm. Futur Gener Comput Syst 101:646–667

    Article  Google Scholar 

  34. Li Y, Zhang W, Wang L, Zhao F, Han W, Chen G (2017) Henry’s law and accumulation of weak source for crust-derived helium: A case study of weihe basin, China. J Nat Gas Geosci 2(5-6):333–339

    Article  Google Scholar 

  35. Neggaz N, Houssein EH, Hussain K (2020) An efficient henry gas solubility optimization for feature selection, Expert Syst Appl pp 113364

  36. Cao W, Liu X, Ni J (2020) Parameter optimization of support vector regression using henry gas solubility optimization algorithm. IEEE Access 8:88633–88642

    Article  Google Scholar 

  37. Saranya S, Saravanan B (2020) Effect of emission in smes based unit commitment using modified henry gas solubility optimization. J Energy Storage 29:101380

    Article  Google Scholar 

  38. Hashim FA, Houssein EH, Hussain K, Mabrouk MS, Al-Atabany W (2020) A modified henry gas solubility optimization for solving motif discovery problem. Neural Comput Appl 32(14):10759–10771

    Article  Google Scholar 

  39. Wolpert DH, Macready WG et al (1995) No free lunch theorems for search, tech. rep., Technical Report SFI-TR-95-02-010 Santa Fe Institute

  40. Wu G, Mallipeddi R, Suganthan PN (2017) Problem definitions and evaluation criteria for the cec 2017 competition on constrained real-parameter optimization, National University of Defense Technology, Changsha, Hunan, PR China and Kyungpook National University, Daegu, South Korea and Nanyang Technological University Singapore, Technical Report

  41. Brown TL (2009) Chemistry: the central science. Pearson Education

  42. Staudinger J, Roberts PV (1996) A critical review of henry’s law constants for environmental applications. Crit Rev Environ Sci Technol 26(3):205–297

    Article  Google Scholar 

  43. Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC’06), vol 1. IEEE, pp 695–701

  44. Xu Y, Yang Z, Li X, Kang H, Yang X (2019) Dynamic opposite learning enhanced teaching–learning-based optimization. Knowl-Based Syst pp 104966

  45. Arora S, Singh S (2019) Butterfly optimization algorithm: a novel approach for global optimization. Soft Comput 23(3):715–734

    Article  Google Scholar 

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

    Article  Google Scholar 

  47. Taghian S, Nadimi-Shahraki MH (2019) Binary sine cosine algorithms for feature selection from medical data. arXiv:1911.07805

  48. Awad PJBNH, Ali MZ (2016) Problem definitions and evaluation criteria for the cec 2017 special session and competition on single objective real-parameter numerical optimization. Int J Intell Comput Cybern

  49. Kennedy J, Mendes R (2002) Population structure and particle swarm performance. In: Proceedings of the congress on evolutionary computation. CEC’02 (Cat. No. 02TH8600), vol 2. IEEE, p 2002

  50. Peram T, Veeramachaneni K, Mohan CK (2003) Fitness-distance-ratio based particle swarm optimization. In: Proceedings of the IEEE swarm intelligence symposium. SIS’03 (Cat. No. 03EX706). IEEE, p 2003

  51. Parsopoulos KE, Vrahatis MN (2005) Unified particle swarm optimization for solving constrained engineering optimization problems. In: International conference on natural computation. Springer, pp 582–591

  52. Clerc M Standard particle swarm optimisation from 2006 to 2011. Particle Swarm Central vol 253

  53. Holland JH (1973) Genetic algorithms and the optimal allocation of trials. SIAM J Comput 2 (2):88–105

    Article  MathSciNet  MATH  Google Scholar 

  54. Clerc M, Kennedy J (2002) The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–73

    Article  Google Scholar 

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

    Article  Google Scholar 

  56. Kennedy J, Everhart R (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science. nagoya japon. IEEE service center Piscataway, NJ

  57. Jordehi AR (2019) Binary particle swarm optimisation with quadratic transfer function: A new binary optimisation algorithm for optimal scheduling of appliances in smart homes. Appl Soft Comput 78:465–480

    Article  Google Scholar 

  58. Arora S, Singh S (2019) Butterfly optimization algorithm: a novel approach for global optimization. Soft Comput 23(3):715–734

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  60. Heidari AA, Mirjalili S, Faris H, Aljarah I, Mafarja M, Chen H (2019) Harris hawks optimization: Algorithm and applications. Futur Gener Comput Syst 97:849–872

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  63. Zhao W, Zhang Z, Wang L (2020) Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications. Eng Appl Artif Intell 87:103300

    Article  Google Scholar 

  64. Arora JS (2004) Introduction to optimum design. Elsevier, New York

    Book  Google Scholar 

  65. Awad N, Ali M, Liang J, Qu B, Suganthan P, Definitions P (2016) Evaluation criteria for the cec 2017 special session and competition on single objective real-parameter numerical optimization,∥; nanyang technological university, Jordan university of science and technology and zhengzhou university, tech. rep., Tech Rep

  66. Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144

    MathSciNet  MATH  Google Scholar 

  67. García S, Fernández A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Inf Sci 180(10):2044–2064

    Article  Google Scholar 

  68. 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–18

    Article  Google Scholar 

  69. Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work is supported by National Science Foundation of China under Grant No. 61473054. The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation.

Author information

Authors and Affiliations

  1. School of Electronic and Information Engineering, University of Science and Technology Liaoning, 114051, Anshan, People’s Republic of China

    Jie Bi & Yong Zhang

Authors
  1. Jie Bi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yong Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

Contributions

Jie Bi participated in the draft writing and critical revision of this paper and participated in the data collection, analysis, and algorithm simulation. Yong Zhang participated in the concept, design, and interpretation of results and commented on the manuscript;

Corresponding author

Correspondence to Yong Zhang.

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

Bi, J., Zhang, Y. An improved Henry gas solubility optimization for optimization tasks. Appl Intell 52, 5966–6006 (2022). https://doi.org/10.1007/s10489-021-02670-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-021-02670-2

Keywords