Abstract
Harmony search (HS) algorithm is relatively a recent metaheuristic optimization method inspired by natural phenomenon of musical improvisation process. Despite its success, the main drawback of harmony search are contained in its tendency to converge prematurely due to its greedy selection method. This probably leads the harmony search algorithm to get stuck in local optima and unsought solutions owing to the limited exploration of the search space. The great deluge algorithm is a local search-based approach that has an efficient capability of increasing diversity and avoiding the local optima. This capability comes from its flexible method of accepting the new constructed solution. The aim of this research is to propose and evaluate a new variant of HS. To do so, the acceptance method of the great deluge algorithm is incorporated in the harmony search to enhance its convergence properties by maintaining a higher rate of diversification at the initial stage of the search process. The proposed method is called Harmony Search Great Deluge (HS-GD) algorithm. The performance of HS-GD and the classical harmony search algorithm was evaluated using a set of ten benchmark global optimization functions. In addition, five benchmark functions of the former set were employed to compare the results of the proposed method with three previous harmony search variations including the classical harmony search. The results show that HS-GD often outperforms the other comparative approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M.S. Abual-Rub, M.A. Al-Betar, R. Abdullah, and A.T. Khader. A hybrid harmony search algorithm for ab initio protein tertiary structure prediction. Network Modeling and Analysis in Health Informatics and, Bioinformatics, pages 1-17.
M. A. Al-Betar, A. T. Khader, and F. Nadi. Selection mechanisms in memory consideration for examination timetabling with harmony search. In GECCO ’10: Proceedings of Genetic and Evolutionary Computation Conference. ACM, Portland, Oregon, USA, July 7-11 2010.
M. A. Al-Betar, A. T. Khader, and J. J. Thomas. A combination of metaheuristic components based on harmony search for the uncapacitated examination timetabling. In 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010), Belfast, Northern Ireland, August 10-13 2010.
M.A. Al-Betar, I.A. Doush, A.T. Khader, and M.A. Awadallah. Novel selection schemes for harmony search. Applied Mathematics and Computation, 218(10), 2011.
M.A. Al-Betar and A.T. Khader. A harmony search algorithm for university course timetabling. Annals of Operations Research, 194:1-29, 2012.
M.A. Al-Betar, A.T. Khader, and M. Zaman. University course timetabling using a hybrid harmony search metaheuristic algorithm. Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, (99):1-18.
O. Alia, M. Al-Betar, R. Mandava, A. Khader. Data clustering using harmony search algorithm. Swarm, Evolutionary, and, Memetic Computing, pages 79-88, 2011.
M. Awadallah, A. Khader, M. Al-Betar, A. Bolaji. Nurse rostering using modified harmony search algorithm. Swarm, Evolutionary, and, Memetic Computing, pages 27-37, 2011.
M.A. Awadallah, A.T. Khader, M.A. Al-Betar, and A.L. Bolaji. Nurse scheduling using harmony search. In Bio-Inspired Computing: Theories and Applications (BIC-TA), 2011 Sixth International Conference on, pages 58-63. IEEE, 2011.
Christian Blum and Andrea Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv., 35(3):268-308, 2003.
P. Chakraborty, G.G. Roy, S. Das, D. Jain, and A. Abraham. An improved harmony search algorithm with differential mutation operator. Fundamenta Informaticae, 95(4):401-426, 2009.
G. Dueck. New optimization heuristics. Journal of computational physics, 104(1):86-92, 2005.
Z. Geem. State-of-the-art in the structure of harmony search algorithm. Recent Advances In Harmony Search Algorithm, pages 1-10, 2010.
Z. W. Geem, J. H. Kim, and G. V. Loganathan. A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2):60-68, 2001.
Z.W. Geem, M. Fesanghary, J. Choi, MP Saka, J.C.Williams, M.T. Ayvaz, L. Li, S. Ryu, and A. Vasebi. Recent advances in harmony search. Advance in evolutionary algorithms, I-Teach Education and Publishing, Vienna, Austria, pages 127-142, 2008.
M. G. H. Omran and M. Mahdavi. Global-best harmony search. Applied Mathematics and Computation, 198(2):643-656, 2008.
Quan-Ke Pan, P.N. Suganthan, M. Fatih Tasgetiren, and J.J. Liang. A self-adaptive global best harmony search algorithm for continuous optimization problems. Applied Mathematics and Computation, 216(3):830 -848, 2010.
AK Qin and F. Forbes. Dynamic regional harmony search with opposition and local learning. In Proceedings of the 13th annual conference companion on Genetic and evolutionary computation, pages 53-54. ACM, 2011.
C.M.Wang and Y.F. Huang. Self-adaptive harmony search algorithm for optimization. Expert Systems with Applications, 37(4):2826-2837, 2010.
Xin Yao, Yong Liu, and Guangming Lin. Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2):82-102, 1999.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer India
About this paper
Cite this paper
Al-Betar, M., Ahmad, O., Khader, A., Awadallah, M. (2013). Incorporating Great Deluge with Harmony Search for Global Optimization Problems. In: Bansal, J., Singh, P., Deep, K., Pant, M., Nagar, A. (eds) Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012). Advances in Intelligent Systems and Computing, vol 201. Springer, India. https://doi.org/10.1007/978-81-322-1038-2_24
Download citation
DOI: https://doi.org/10.1007/978-81-322-1038-2_24
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-1037-5
Online ISBN: 978-81-322-1038-2
eBook Packages: EngineeringEngineering (R0)