Skip to main content
Springer Nature Link
Log in

Hybrid Henry gas solubility optimization algorithm with dynamic cluster-to-algorithm mapping

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

This paper discusses a new variant of Henry Gas Solubility Optimization (HGSO) Algorithm, called Hybrid HGSO (HHGSO). Unlike its predecessor, HHGSO allows multiple clusters serving different individual meta-heuristic algorithms (i.e., with its own defined parameters and local best) to coexist within the same population. Exploiting the dynamic cluster-to-algorithm mapping via penalized and reward model with adaptive switching factor, HHGSO offers a novel approach for meta-heuristic hybridization consisting of Jaya Algorithm, Sooty Tern Optimization Algorithm, Butterfly Optimization Algorithm, and Owl Search Algorithm, respectively. The acquired results from the selected two case studies (i.e., involving team formation problem and combinatorial test suite generation) indicate that the hybridization has notably improved the performance of HGSO and gives superior performance against other competing meta-heuristic and hyper-heuristic 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

Similar content being viewed by others

Explore related subjects

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

References

  1. Vahidi B, Foroughi Nematolahi A (2019) Physical and physic-chemical based optimization methods: a review. J Soft Comput Civ Eng 3(4):12–27. https://doi.org/10.22115/scce.2020.214959.1161

    Article  Google Scholar 

  2. Lim SM, Leong KY (2018) A brief survey on intelligent swarm-based algorithms for solving optimization problems. In: Del Ser J, Osaba E (eds) Nature inspired methods for stochastic, robust and dynamic optimization, vol 47, pp 47–61. https://doi.org/10.5772/intechopen.76979

  3. Lones MA (2020) Mitigating metaphors: a comprehensible guide to recent nature-inspired algorithms. SN Comput Sci 1(1):1–12. https://doi.org/10.1007/s42979-019-0050-8

    Article  Google Scholar 

  4. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680. https://doi.org/10.1126/science.220.4598.671

    Article  MathSciNet  MATH  Google Scholar 

  5. Voudouris C (1998) Guided local search: an illustrative example in function optimisation. BT Technol J 16(3):46–50. https://doi.org/10.1023/A:1009665513140

    Article  Google Scholar 

  6. Polat O (2017) A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups. Comput Oper Res 85:71–86. https://doi.org/10.1016/j.cor.2017.03.009

    Article  MathSciNet  MATH  Google Scholar 

  7. Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90(1):161–175. https://doi.org/10.1016/0021-9991(90)90201-B

    Article  MathSciNet  MATH  Google Scholar 

  8. Glover F, Laguna M (1998) Tabu search. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization. Springer, Berlin, pp 2093–2229. https://doi.org/10.1007/978-1-4613-0303-9_33

    Chapter  Google Scholar 

  9. Venkata Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7:19–34. https://doi.org/10.5267/j.ijiec.2015.8.004

    Article  Google Scholar 

  10. Dhiman G, Kaur A (2019) STOA: a bio-inspired based optimization algorithm for industrial engineering problems. Eng Appl Artif Intell 82:148–174. https://doi.org/10.1016/j.engappai.2019.03.021

    Article  Google Scholar 

  11. Arora S, Singh S (2019) Butterfly optimization algorithm: a novel approach for global optimization. Soft Comput 23(3):715–734. https://doi.org/10.1007/s00500-018-3102-4

    Article  Google Scholar 

  12. Jain M, Singh V, Rani A (2018) A novel nature-inspired algorithm for optimization: squirrel search algorithm. Swarm Evol Comput 44:148–175. https://doi.org/10.1016/j.swevo.2018.02.013

    Article  Google Scholar 

  13. Hashim FA, Houssein EH, Mabrouk MS, Al-Atabany W, Mirjalili S (2019) Henry gas solubility optimization: a novel physics-based algorithm. Future Gener Comput Syst 101:646–667. https://doi.org/10.1016/j.future.2019.07.015

    Article  Google Scholar 

  14. Zhao W, Zhang Z, Wang L (2020) Manta ray foraging optimization: an effective bio-inspired optimizer for engineering applications. Eng Appl Artif Intell 87:1–25. https://doi.org/10.1016/j.engappai.2019.103300

    Article  Google Scholar 

  15. Kaveh A, Eslamlou AD (2020) Water strider algorithm: a new metaheuristic and applications. In: Proceedings of the structures, vol 25. Elsevier, Amsterdam, pp 520–541. https://doi.org/10.1016/j.istruc.2020.03.033

  16. Yadav A, Kumar N (2020) Artificial electric field algorithm for engineering optimization problems. Expert Syst Appl 149:1–23. https://doi.org/10.1016/j.eswa.2020.113308

    Article  Google Scholar 

  17. Faramarzi A, Heidarinejad M, Stephens B, Mirjalili S (2020) Equilibrium optimizer: a novel optimization algorithm. Knowl Based Syst 191:105190. https://doi.org/10.1016/j.knosys.2019.105190

    Article  Google Scholar 

  18. Maciel O, Cuevas E, Navarro MA, Zaldívar D, Hinojosa S (2020) Side-blotched lizard algorithm: a polymorphic population approach. Appl Soft Comput 88:1–24. https://doi.org/10.1016/j.asoc.2019.106039

    Article  Google Scholar 

  19. Askari Q, Younas I, Saeed M (2020) Political optimizer: a novel socio-inspired meta-heuristic for global optimization. Knowl Based Syst 1–25, Art no. 105709. https://doi.org/10.1016/j.knosys.2020.105709

  20. Moosavi SHS, Bardsiri VK (2019) Poor and rich optimization algorithm: a new human-based and multi populations algorithm. Eng Appl Artif Intell 86:165–181. https://doi.org/10.1016/j.engappai.2019.08.025

    Article  Google Scholar 

  21. Kaur S, Awasthi LK, Sangal A, Dhiman G (2020) Tunicate swarm algorithm: a new bio-inspired based metaheuristic paradigm for global optimization. Eng Appl Artif Intell 90:1–29. https://doi.org/10.1016/j.engappai.2020.103541

    Article  Google Scholar 

  22. Zhang Z, Ding S, Jia W (2019) A hybrid optimization algorithm based on cuckoo search and differential evolution for solving constrained engineering problems. Eng Appl Artif Intell 85:254–268. https://doi.org/10.1016/j.engappai.2019.06.017

    Article  Google Scholar 

  23. Zamli KZ, Din F, Ahmed BS, Bures M (2018) A hybrid Q-learning sine–cosine-based strategy for addressing the combinatorial test suite minimization problem. PLoS ONE 13(5):1–29. https://doi.org/10.1371/journal.pone.0195675

    Article  Google Scholar 

  24. Zamli KZ (2018) Enhancing generality of meta-heuristic algorithms through adaptive selection and hybridization. In: Proceedings of the 2018 international conference on information and communications technology. IEEE, pp 67–71. https://doi.org/10.1109/icoiact.2018.8350825

  25. Ahmed BS, Enoiu E, Afzal W, Zamli KZ (2020) An evaluation of monte carlo-based hyper-heuristic for interaction testing of industrial embedded software applications. Soft Comput 24(18):13929–13954. https://doi.org/10.1007/s00500-020-04769-z

    Article  Google Scholar 

  26. Ayob M, Kendall G (2003) A monte carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. In: Proceedings of the international conference on intelligent technologies, InTech, vol 3, pp 132–141

  27. Choong SS, Wong L-P, Lim CP (2019) An artificial bee colony algorithm with a modified choice function for the traveling salesman problem. Swarm Evol Comput 44:622–635. https://doi.org/10.1016/j.swevo.2018.08.004

    Article  Google Scholar 

  28. Drake JH, Özcan E, Burke EK (2015) A modified choice function hyper-heuristic controlling unary and binary operators. In: Proceedings of the 2015 IEEE Congress on evolutionary computation (CEC), pp 3389–3396. https://doi.org/10.1109/cec.2015.7257315

  29. Zamli KZ, Alkazemi BY, Kendall G (2016) A tabu search hyper-heuristic strategy for t-way test suite generation. Appl Soft Comput 44:57–74. https://doi.org/10.1016/j.asoc.2016.03.021

    Article  Google Scholar 

  30. Zamli KZ, Din F, Kendall G, Ahmed BS (2017) An experimental study of hyper-heuristic selection and acceptance mechanism for combinatorial t-way test suite generation. Inf Sci 399:121–153. https://doi.org/10.1016/j.ins.2017.03.007

    Article  Google Scholar 

  31. Jain M, Maurya S, Rani A, Singh V (2018) Owl search algorithm: a novel nature-inspired heuristic paradigm for global optimization. J Intell Fuzzy Syst 34:1573–1582. https://doi.org/10.3233/jifs-169452

    Article  Google Scholar 

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

    Article  Google Scholar 

  33. Talbi E-G (2013) A unified taxonomy of hybrid metaheuristics with mathematical programming, constraint programming and machine learning. In: Hybrid metaheuristics. Springer, pp 3–76

  34. Nasser AB, Zamli KZ, Alsewari AA, Ahmed BS (2018) Hybrid flower pollination algorithm strategies for t-way test suite generation. PLoS ONE 13(5):1–24. https://doi.org/10.1371/journal.pone.0195187. (in Eng)

    Article  Google Scholar 

  35. Rambabu B, Reddy AV, Janakiraman S (2019) Hybrid artificial bee colony and monarchy butterfly optimization algorithm (HABC-MBOA)-based cluster head selection for WSNs. J King Saud Univ Comput Inf Sci. https://doi.org/10.1016/j.jksuci.2019.12.006

    Article  Google Scholar 

  36. Long W, Cai S, Jiao J, Xu M, Wu T (2020) A new hybrid algorithm based on grey wolf optimizer and cuckoo search for parameter extraction of solar photovoltaic models. Energy Convers Manag 203:1–14. https://doi.org/10.1016/j.enconman.2019.112243

    Article  Google Scholar 

  37. Yang X-S (2012) Flower pollination algorithm for global optimization. In: Proceedings of the international conference on unconventional computing and natural computation, vol 7445. Springer, Berlin, pp 240–249. https://doi.org/10.1007/978-3-642-32894-7_27

  38. 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. https://doi.org/10.1007/s10898-007-9149-x

    Article  MathSciNet  MATH  Google Scholar 

  39. Wang G-G, Deb S, Cui Z (2019) Monarch butterfly optimization. Neural Comput Appl 31(7):1995–2014. https://doi.org/10.1007/s00521-015-1923-y

    Article  Google Scholar 

  40. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007

    Article  Google Scholar 

  41. Yang X-S, Deb S (2009) Cuckoo search via lévy flights. In: Proceedings of the 2009 World Congress on nature and biologically inspired computing. IEEE, pp 210–214. https://doi.org/10.1109/nabic.2009.5393690

  42. Alotaibi SS (2020) Optimization insisted watermarking model: hybrid firefly and jaya algorithm for video copyright protection. Soft Comput. https://doi.org/10.1007/s00500-020-04833-8

    Article  Google Scholar 

  43. Sharma S, Saha AK, Ramasamy V, Sarkar JL, Panigrahi CR (2020) hBOSOS: an ensemble of butterfly optimization algorithm and symbiosis organisms search for global optimization. In: Advanced computing and intelligent engineering. Springer, pp 579–588

  44. Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl Based Syst 96:120–133. https://doi.org/10.1016/j.knosys.2015.12.022

    Article  Google Scholar 

  45. Zames G et al (1981) Genetic algorithms in search, optimization and machine learning. Inf Technol J 3(1):301–302

    MATH  Google Scholar 

  46. Yang X-S (2008) Firefly algorithm. In: Nature-inspired metaheuristic algorithms, vol 20, pp 79–90

  47. Cheng M-Y, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112. https://doi.org/10.1016/j.compstruc.2014.03.007

    Article  Google Scholar 

  48. Drake JH, Kheiri A, Özcan E, Burke EK (2019) Recent advances in selection hyper-heuristics. Eur J Oper Res. https://doi.org/10.1016/j.ejor.2019.07.073

    Article  MATH  Google Scholar 

  49. Ahmed BS, Enoiu E, Afzal W, Zamli KZ (2020) An evaluation of monte carlo-based hyper-heuristic for interaction testing of industrial embedded software applications. Soft Comput. https://doi.org/10.1007/s00500-020-04769-z

    Article  Google Scholar 

  50. Zamli KZ, Din F, Baharom S, Ahmed BS (2017) Fuzzy adaptive teaching learning-based optimization strategy for the problem of generating mixed strength t-way test suites. Eng Appl Artif Intell 59:35–50. https://doi.org/10.1016/j.engappai.2016.12.014

    Article  Google Scholar 

  51. Din F, Zamli KZ (2018) Hyper-heuristic based strategy for pairwise test case generation. Adv Sci Lett 24(10):7333–7338. https://doi.org/10.1166/asl.2018.12938

    Article  Google Scholar 

  52. Luan J, Yao Z, Zhao F, Song X (2019) A novel method to solve supplier selection problem: hybrid algorithm of genetic algorithm and ant colony optimization. Math Comput Simul 156:294–309. https://doi.org/10.1016/j.matcom.2018.08.011

    Article  MathSciNet  MATH  Google Scholar 

  53. Noori S, Ghannadpour SF (2012) High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows. J Math Model Algorithms 11(2):159–179. https://doi.org/10.1007/s10852-011-9171-3

    Article  MathSciNet  MATH  Google Scholar 

  54. Lepagnot J, Idoumghar L, Brévilliers M, Idrissi-Aouad M (2017) A new high-level relay hybrid metaheuristic for black-box optimization problems. In: Proceedings of the international conference on artificial evolution. Springer, Berlin, pp 115–128. https://doi.org/10.1007/978-3-319-78133-4_9

  55. Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. Biosystems 43(2):73–81. https://doi.org/10.1016/S0303-2647(97)01708-5

    Article  Google Scholar 

  56. Lepagnot J, Nakib A, Oulhadj H, Siarry P (2013) A multiple local search algorithm for continuous dynamic optimization. J Heuristics 19(1):35–76. https://doi.org/10.1007/s10732-013-9215-0

    Article  Google Scholar 

  57. Viktorin A, Pluhacek M, Senkerik R (2016) Success-history based adaptive differential evolution algorithm with multi-chaotic framework for parent selection performance on CEC2014 benchmark set. In: Proceedings of the 2016 IEEE Congress on evolutionary computation (IEEE CEC). IEEE, pp 4797–4803. https://doi.org/10.1109/cec.2016.7744404

  58. Zambrano-Bigiarini M, Clerc M, Rojas R (2013) Standard particle swarm optimisation 2011 at CEC-2013: a baseline for future PSO improvements. In: Proceedings of the 2013 IEEE Congress on evolutionary computation. IEEE, pp 2337–2344. https://doi.org/10.1109/cec.2013.6557848

  59. Rao RV, Savsani V, Balic J (2012) Teaching–learning-based optimization algorithm for unconstrained and constrained real-parameter optimization problems. Eng Optim 44(12):1447–1462. https://doi.org/10.1080/0305215X.2011.652103

    Article  Google Scholar 

  60. Pourvaziri H, Naderi B (2014) A hybrid multi-population genetic algorithm for the dynamic facility layout problem. Appl Soft Comput 24:457–469. https://doi.org/10.1016/j.asoc.2014.06.051

    Article  Google Scholar 

  61. Zhou J, Yao X (2017) Multi-population parallel self-adaptive differential artificial bee colony algorithm with application in large-scale service composition for cloud manufacturing. Appl Soft Comput 56:379–397. https://doi.org/10.1016/j.asoc.2017.03.017

    Article  Google Scholar 

  62. Chen H, Heidari AA, Chen H, Wang M, Pan Z, Gandomi AH (2020) Multi-population differential evolution-assisted Harris Hawks optimization: framework and case studies. Future Gener Comput Syst. https://doi.org/10.1016/j.future.2020.04.008

    Article  Google Scholar 

  63. 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. https://doi.org/10.1023/A:1008202821328

    Article  MathSciNet  MATH  Google Scholar 

  64. Heidari AA, Mirjalili S, Faris H, Aljarah I, Mafarja M, Chen H (2019) Harris Hawks optimization: algorithm and applications. Future Gener Comput Syst 97:849–872. https://doi.org/10.1016/j.future.2019.02.028

    Article  Google Scholar 

  65. Cruz-Chávez MA et al (2019) Hybrid micro genetic multi-population algorithm with collective communication for the job shop scheduling problem. IEEE Access 7:82358–82376. https://doi.org/10.1109/ACCESS.2019.2924218

    Article  Google Scholar 

  66. Łapa K, Cpałka K, Paszkowski J (2019) Hybrid multi-population based approach for controllers structure and parameters selection. In: Proceedings of the international conference on artificial intelligence and soft computing. Springer, Berlin, pp 456–468. https://doi.org/10.1007/978-3-030-20912-4_42

  67. Brown TL (2009) Chemistry: the central science. Pearson Education, New Delhi

    Google Scholar 

  68. Mohebbi V, Naderifar A, Behbahani R, Moshfeghian M (2012) Determination of Henry’s law constant of light hydrocarbon gases at low temperatures. J Chem Thermodyn 51:8–11. https://doi.org/10.1016/j.jct.2012.02.014

    Article  Google Scholar 

  69. 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. https://doi.org/10.1080/10643389609388492

    Article  Google Scholar 

  70. Lappas T, Liu K, Terzi E (2009) Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, Paris, France, 2009. Association for Computing Machinery, pp 467–476. https://doi.org/10.1145/1557019.1557074

  71. IMDB (2020) “IMDB Dataset”. https://github.com/MAK660/Dataset/blob/master/IMDB_DataSet.txt. Accessed 15 May 2020

  72. T. D. Team (2019) “DBLP Dataset”. https://github.com/MAK660/Dataset/blob/master/DBLP_DataSet.txt. Accessed Nov 2019

  73. UMP. “Faculty Staff Expertise FKOM data set.” https://github.com/MAK660/Dataset/blob/master/Staff_Expertise_DataSet.txt. Accessed 10 Jan 2020

  74. Hassan AA, Abdullah S, Zamli KZ, Razali R (2020) Combinatorial test suites generation strategy utilizing the whale optimization algorithm. IEEE Access 8:192288–192303. https://doi.org/10.1109/ACCESS.2020.3032851

    Article  Google Scholar 

Download references

Acknowledgements

The work reported in this paper is funded by the Malaysian Technical University Network (MTUN) Research Grant from the Ministry of Higher Education Malaysia titled: The Development of T-Way Test Generation Tool for Combinatorial Testing (Grant No: UIC19102). Bestoun S. Ahmed supported by the Knowledge Foundation of Sweden (KKS) through the Synergy Project AIDA - A Holistic AI-driven Networking and Processing Framework for Industrial IoT (Rek:20200067).

Author information

Authors and Affiliations

  1. Faculty of Computing, College of Computing and Applied Sciences, Universiti Malaysia Pahang, 26600, Pekan, Pahang, Malaysia

    Kamal Z. Zamli, Md. Abdul Kader & Saiful Azad

  2. Department of Mathematics and Computer Science, Karlstad University, 65188, Karlstad, Sweden

    Bestoun S. Ahmed

Authors
  1. Kamal Z. Zamli
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Md. Abdul Kader
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Saiful Azad
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Bestoun S. Ahmed
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Kamal Z. Zamli.

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

Zamli, K.Z., Kader, M.A., Azad, S. et al. Hybrid Henry gas solubility optimization algorithm with dynamic cluster-to-algorithm mapping. Neural Comput & Applic 33, 8389–8416 (2021). https://doi.org/10.1007/s00521-020-05594-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-020-05594-z

Keywords