Modified Tournament Harmony Search for Unconstrained Optimisation Problems | SpringerLink
Skip to main content
Springer Nature Link
Log in

Modified Tournament Harmony Search for Unconstrained Optimisation Problems

  • Conference paper
Recent Advances on Soft Computing and Data Mining

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

Abstract

Lately, Harmony Search algorithm (HSA) has attracted the attentions of researchers in operation research and artificial intelligence domain due to its capabilities of solving complex optimization problems in various fields. Different variants of HSA were proposed to overcome its weaknesses such as stagnation at local optima and slow convergence. The limitations of HSA have been mainly addressed in three aspects: studying the effect of HSA parameter settings, hybridizing it with other part of metaheuristic algorithms and the selection schemes that are used in selecting decision variables from harmony memory vectors. This paper focuses on improving the performance of HSA by introducing a new variant of HSA named Modified Tournament Harmony Search (MTHS) algorithm. The MTHS modifies the tournament selection scheme in order to improve the performance and efficiency of the classical HSA. Empirical results demonstrate the effectiveness of the proposed MTHS method and show its significance when compared with three benchmark variants of HSA.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 22879
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 28599
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Ceylan, H., Ceylan, H.: Harmony search algorithm for transport energy demand modeling. In: Geem, Z.W. (ed.) Music-Inspired Harmony Search Algorithm. SCI, vol. 191, pp. 163–172. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Salman, A., Ahmad, I., Hanaa, A.R., Hamdan, S.: Solving the task assignment problem using Harmony Search algorithm. Evolving Systems, 1–17 (2012)

    Google Scholar 

  4. Yuan, Y., Xu, H., Yang, J.: A hybrid harmony search algorithm for the flexible job shop scheduling problem. Applied Soft Computing (2013)

    Google Scholar 

  5. Zou, D., Gao, L., Li, S., Wu, J.: Solving 0–1 knapsack problem by a novel global harmony search algorithm. Applied Soft Computing 11(2), 1556–1564 (2011)

    Article  Google Scholar 

  6. Khazali, A.H., Kalantar, M.: Optimal reactive power dispatch based on harmony search algorithm. International Journal of Electrical Power & Energy Systems 33(3), 684–692 (2011)

    Article  Google Scholar 

  7. Baek, C.W., Jun, H.D., Kim, J.H.: Development of a PDA model for water distribution systems using harmony search algorithm. KSCE Journal of Civil Engineering 14(4), 613–625 (2010)

    Article  Google Scholar 

  8. Forsati, R., Mahdavi, M.: Web text mining using harmony search. In: Recent Advances in Harmony Search Algorithm. SCI, vol. 270, pp. 51–64. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Pichpibul, T., Kawtummachai, R.: Modified Harmony Search Algorithm for the Capacitated Vehicle Routing Problem. In: Proceedings of the International Multi Conference of Engineers and Computer Scientists, vol. 2 (2013)

    Google Scholar 

  10. Shambour, M.K.Y., Khader, A.T., Kheiri, A., Özcan, E.: A Two Stage Approach for High School Timetabling. In: Lee, M., Hirose, A., Hou, Z.-G., Kil, R.M. (eds.) ICONIP 2013. LNCS, vol. 8226, pp. 66–73. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Geem, Z.W., Choi, J.-Y.: Music composition using harmony search algorithm. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 593–600. Springer, Heidelberg (2007)

    Google Scholar 

  12. Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation 188(2), 1567–1579 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Omran, M.G., Mahdavi, M.: Global-best harmony search. Applied Mathematics and Computation 198(2), 643–656 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Pan, Q.K., Suganthan, P.N., Tasgetiren, M.F., Liang, J.J.: A self-adaptive global best harmony search algorithm for continuous optimization problems. Applied Mathematics and Computation 216(3), 830–848 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  15. Doush, I.A.: Harmony search with multi-parent crossover for solving IEEE-CEC2011 competition problems. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds.) ICONIP 2012, Part IV. LNCS, vol. 7666, pp. 108–114. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  16. Wang, C.M., Huang, Y.F.: Self-adaptive Harmony Search Algorithm for Optimization. Expert Syst. Appl. 37, 2826–2837 (2010)

    Article  Google Scholar 

  17. Chakraborty, P., Roy, G.G., Das, S., Jain, D., Abraham, A.: An improved harmony search algorithm with differential mutation operator. Fundamenta Informaticae 95(4), 401–426 (2009)

    MATH  MathSciNet  Google Scholar 

  18. Zou, D., Gao, L., Wu, J., Li, S.: Novel global harmony search algorithm for unconstrained problems. Neurocomputing 73(16), 3308–3318 (2009)

    Google Scholar 

  19. Pan, Q.K., Suganthan, P.N., Tasgetiren, M.F., Liang, J.J.: A self-adaptive global best harmony search algorithm for continuous optimization problems. Applied Mathematics and Computation 216(3), 830–848 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  20. Al-Betar, M.A., Doush, I.A., Khader, A.T., Awadallah, M.A.: Novel selection schemes for harmony search. Applied Mathematics and Computation 218(10), 6095–6117 (2012)

    Article  MATH  Google Scholar 

  21. Kattan, A., Abdullah, R.: A dynamic self-adaptive harmony search algorithm for continuous optimization problems. Applied Mathematics and Computation 219, 8542–8567 (2013)

    Article  MathSciNet  Google Scholar 

  22. Ortiz-Boyer, D., Hervás-Martínez, C., García-Pedrajas, N.: CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features. J. Artif. Intell. Res(JAIR) 24, 1–48 (2005)

    Article  MATH  Google Scholar 

  23. Digalakis, J.G., Margaritis, K.G.: On benchmarking functions for genetic algorithms. International Journal of Computer Mathematics 77(4), 481–506 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  24. Yang, X.S., Cui, Z., Xiao, R., Gandomi, A.H.: Swarm intelligence and bio-inspired computation: theory and applications. Elsevier (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Sciences, Universiti Sains Malaysia, 11800, Pulau Pinang, Malaysia

    Moh’d Khaled Shambour, Ahamad Tajudin Khader & Ahmed A. Abusnaina

  2. Software Engineering Department, Al-Ahliyya Amman University, Amman, Jordan, Malaysia

    Qusai Shambour

Authors
  1. Moh’d Khaled Shambour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ahamad Tajudin Khader
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahmed A. Abusnaina
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qusai Shambour
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moh’d Khaled Shambour .

Editor information

Editors and Affiliations

  1. Department of Information System Faculty of Comp. Sci. & Info. Tech., University of Malaya, Kuala Lumpur, Malaysia

    Tutut Herawan

  2. Faculty of Comp. Sci. and Info. Tech, Universiti Tun Hussein Onn Malaysia, Parit Raja, Malaysia

    Rozaida Ghazali

  3. Faculty of Comp. Sci. and Info. Tech., Universiti Tun Hussein Onn Malaysia, Parit Raja, Malaysia

    Mustafa Mat Deris

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Shambour, M.K., Khader, A.T., Abusnaina, A.A., Shambour, Q. (2014). Modified Tournament Harmony Search for Unconstrained Optimisation Problems. In: Herawan, T., Ghazali, R., Deris, M. (eds) Recent Advances on Soft Computing and Data Mining. Advances in Intelligent Systems and Computing, vol 287. Springer, Cham. https://doi.org/10.1007/978-3-319-07692-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07692-8_27

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07691-1

  • Online ISBN: 978-3-319-07692-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics