Skip to main content

Modified Opposition Based Learning to Improve Harmony Search Variants Exploration

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1073))

Abstract

Harmony Search Algorithm (HS) is a well-known optimization algorithm with strong and robust exploitation process. HS such as many optimization algorithms suffers from a weak exploration and susceptible to fall in local optima. Owing to its weaknesses, many variants of HS were introduced in the last decade to improve its performance. The Opposition-based learning and its variants have been successfully employed to improve many optimization algorithms, including HS. Opposition-based learning variants enhanced the explorations and help optimization algorithms to avoid local optima falling. Thus, inspired by a new opposition-based learning variant named modified opposition-based learning (MOBL), this research employed the MOBL to improve five well-known variants of HS. The new improved variants are evaluated using nine classical benchmark function and compared with the original variants to evaluate the effectiveness of the proposed technique. The results show that MOBL improved the HS variants in term of exploration and convergence rate.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Baker, J.E.: Adaptive selection methods for genetic algorithms. In: Proceedings of an International Conference on Genetic Algorithms and Their Applications. Hillsdale, New Jersey (1985)

    Google Scholar 

  2. Karaboga, D., Basturk, B.: Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: International Fuzzy Systems Association World Congress. Springer (2007)

    Google Scholar 

  3. Yang, X.-S.: Firefly algorithm, stochastic test functions and design optimisation. arXiv preprint arXiv:1003.1409 (2010)

  4. Alomoush, W., et al.: Firefly photinus search algorithm. J. King Saud Univ.-Comput. Inf. Sci., 1319–1578 (2018, in press)

    Google Scholar 

  5. Geem, Z.W., Kim, J.H., Loganathan, G.: A new heuristic optimization algorithm: harmony search. simulation 76(2), 60–68 (2001)

    Google Scholar 

  6. Alsewari, A.A., Zamli, K.Z.: Interaction test data generation using harmony search algorithm. In: 2011 IEEE Symposium on Industrial Electronics and Applications (ISIEA). IEEE (2011)

    Google Scholar 

  7. Alsewari, A.R.A., Zamli, K.Z.: A harmony search based pairwise sampling strategy for combinatorial testing. Int. J. Phys. Sci. 7(7), 1062–1072 (2012)

    Google Scholar 

  8. Alsewari, A.R.A., Zamli, K.Z.: Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support. Inf. Software Technol. 54(6), 553–568 (2012)

    Article  Google Scholar 

  9. Alsewari, A., Zamli, K., Al-Kazemi, B.: Generating t-way test suite in the presence of constraints. J. Eng. Technol. (JET) 6(2), 52–66 (2015)

    Google Scholar 

  10. Nazari-Heris, M., et al.: Large-scale combined heat and power economic dispatch using a novel multi-player harmony search method. Appl. Therm. Eng. 154, 493–504 (2019)

    Article  Google Scholar 

  11. Cuevas, E., et al.: Circle detection by harmony search optimization. J. Intell. Robot. Syst. 66(3), 359–376 (2012)

    Article  Google Scholar 

  12. Alomoush, W., Norwawi, A.A.N., Alomari, Y.M., Albashish, D.: A survey: challenges of image segmentation based fuzzy C-means clustering algorithm. J. Theor. Appl. Inf. Technol. 96(16), 18 (2018)

    Google Scholar 

  13. Ala’a, A., et al.: Comprehensive review of the development of the harmony search algorithm and its applications. IEEE Access 17(7), 14233–14245 (2019)

    Google Scholar 

  14. Manjarres, D., et al.: A survey on applications of the harmony search algorithm. Eng. Appl. Artif. Intell. 26(8), 1818–1831 (2013)

    Article  Google Scholar 

  15. Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Appl. Math. Comput. 188(2), 1567–1579 (2007)

    MathSciNet  MATH  Google Scholar 

  16. Omran, M.G., Mahdavi, M.: Global-best harmony search. Appl. Math. Comput. 198(2), 643–656 (2008)

    MathSciNet  MATH  Google Scholar 

  17. Wang, C.-M., Huang, Y.-F.: Self-adaptive harmony search algorithm for optimization. Expert Syst. Appl. 37(4), 2826–2837 (2010)

    Article  Google Scholar 

  18. Alaa, A., Alomoush, A.A.A., et al.: Hybrid harmony search algorithm with grey wolf optimizer and modified opposition-based learning. IEEE Access 7, 1–3 (2019)

    Google Scholar 

  19. Das, S., et al.: Exploratory power of the harmony search algorithm: analysis and improvements for global numerical optimization. IEEE Trans. Syst. Man Cybern. Part B (Cybern) 41(1), 89–106 (2011)

    Google Scholar 

  20. Tizhoosh, H.R.: Opposition-based learning: a new scheme for machine intelligence. In: 2005 International Conference on Intelligent Agents, Web Technologies and Internet Commerce Computational Intelligence for Modelling, Control and Automation. IEEE (2005)

    Google Scholar 

  21. Gao, X., et al.: A hybrid optimization method of harmony search and opposition-based learning. Eng. Optim. 44(8), 895–914 (2012)

    Article  Google Scholar 

  22. Xiang, W.-L., et al.: An improved global-best harmony search algorithm for faster optimization. Expert Syst. Appl. 41(13), 5788–5803 (2014)

    Article  Google Scholar 

  23. Guo, Z., et al.: Global harmony search with generalized opposition-based learning. Soft. Comput. 21(8), 2129–2137 (2017)

    Article  Google Scholar 

  24. Zou, D., et al.: Novel global harmony search algorithm for unconstrained problems. Neurocomputing 73(16), 3308–3318 (2010)

    Article  Google Scholar 

  25. Pan, Q.-K., et al.: A self-adaptive global best harmony search algorithm for continuous optimization problems. Appl. Math. Comput. 216(3), 830–848 (2010)

    MathSciNet  MATH  Google Scholar 

  26. Assad, A., Deep, K.: A Hybrid Harmony search and Simulated Annealing algorithm for continuous optimization. Inf. Sci. 450, 246–266 (2018)

    Article  Google Scholar 

  27. Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: 1995 Proceedings of the Sixth International Symposium on Micro Machine and Human Science, MHS 1995, pp. 39–43 (1995)

    Google Scholar 

  28. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Google Scholar 

Download references

Acknowledgment

This research is funded by, UMP (RDU190334): A Novel Hybrid Harmony Search Algorithm with Nomadic People Optimizer Algorithm for Global Optimization and Feature Selection, and (FRGS/1/2018/ICT05/UMP/02/1) (RDU190102): A Novel Hybrid Kidney-Inspired Algorithm for Global Optimization Enhance Kidney Algorithm for IoT Combinatorial Testing Problem.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Alaa A. Alomoush or AbdulRahman A. Alsewari .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Alomoush, A.A., Alsewari, A.A., Alamri, H.S., Zamli, K.Z., Alomoush, W., Younis, M.I. (2020). Modified Opposition Based Learning to Improve Harmony Search Variants Exploration. In: Saeed, F., Mohammed, F., Gazem, N. (eds) Emerging Trends in Intelligent Computing and Informatics. IRICT 2019. Advances in Intelligent Systems and Computing, vol 1073. Springer, Cham. https://doi.org/10.1007/978-3-030-33582-3_27

Download citation

Publish with us

Policies and ethics