Advertisement

Modified Opposition Based Learning to Improve Harmony Search Variants Exploration

  • Alaa A. AlomoushEmail author
  • AbdulRahman A. AlsewariEmail author
  • Hammoudeh S. Alamri
  • Kamal Z. Zamli
  • Waleed Alomoush
  • Mohammed I. Younis
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (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.

Keywords

Harmony search Opposition based learning Meta-heuristics Evolutionary algorithms Optimization 

Notes

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.

References

  1. 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. 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. 3.
    Yang, X.-S.: Firefly algorithm, stochastic test functions and design optimisation. arXiv preprint arXiv:1003.1409 (2010)
  4. 4.
    Alomoush, W., et al.: Firefly photinus search algorithm. J. King Saud Univ.-Comput. Inf. Sci., 1319–1578 (2018, in press)Google Scholar
  5. 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. 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. 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. 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)CrossRefGoogle Scholar
  9. 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. 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)CrossRefGoogle Scholar
  11. 11.
    Cuevas, E., et al.: Circle detection by harmony search optimization. J. Intell. Robot. Syst. 66(3), 359–376 (2012)CrossRefGoogle Scholar
  12. 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. 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. 14.
    Manjarres, D., et al.: A survey on applications of the harmony search algorithm. Eng. Appl. Artif. Intell. 26(8), 1818–1831 (2013)CrossRefGoogle Scholar
  15. 15.
    Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Appl. Math. Comput. 188(2), 1567–1579 (2007)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Omran, M.G., Mahdavi, M.: Global-best harmony search. Appl. Math. Comput. 198(2), 643–656 (2008)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Wang, C.-M., Huang, Y.-F.: Self-adaptive harmony search algorithm for optimization. Expert Syst. Appl. 37(4), 2826–2837 (2010)CrossRefGoogle Scholar
  18. 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. 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. 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. 21.
    Gao, X., et al.: A hybrid optimization method of harmony search and opposition-based learning. Eng. Optim. 44(8), 895–914 (2012)CrossRefGoogle Scholar
  22. 22.
    Xiang, W.-L., et al.: An improved global-best harmony search algorithm for faster optimization. Expert Syst. Appl. 41(13), 5788–5803 (2014)CrossRefGoogle Scholar
  23. 23.
    Guo, Z., et al.: Global harmony search with generalized opposition-based learning. Soft. Comput. 21(8), 2129–2137 (2017)CrossRefGoogle Scholar
  24. 24.
    Zou, D., et al.: Novel global harmony search algorithm for unconstrained problems. Neurocomputing 73(16), 3308–3318 (2010)CrossRefGoogle Scholar
  25. 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)MathSciNetzbMATHGoogle Scholar
  26. 26.
    Assad, A., Deep, K.: A Hybrid Harmony search and Simulated Annealing algorithm for continuous optimization. Inf. Sci. 450, 246–266 (2018)CrossRefGoogle Scholar
  27. 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. 28.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Alaa A. Alomoush
    • 2
    Email author
  • AbdulRahman A. Alsewari
    • 1
    • 2
    Email author
  • Hammoudeh S. Alamri
    • 3
  • Kamal Z. Zamli
    • 2
  • Waleed Alomoush
    • 3
  • Mohammed I. Younis
    • 4
  1. 1.IBM Centre of Excellence, Universiti Malaysia PahangGambangMalaysia
  2. 2.Faculty of Computing, College of Computing and Applied SciencesUniversiti Malaysia PahangKuantanMalaysia
  3. 3.Computer Science DepartmentImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia
  4. 4.Department of Computer Engineering, College of EngineeringUniversity of BaghdadBaghdadIraq

Personalised recommendations