{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:28:44Z","timestamp":1743143324901,"version":"3.40.3"},"publisher-location":"India","reference-count":20,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132210375"},{"type":"electronic","value":"9788132210382"}],"license":[{"start":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T00:00:00Z","timestamp":1354579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T00:00:00Z","timestamp":1354579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-81-322-1038-2_24","type":"book-chapter","created":{"date-parts":[[2012,12,3]],"date-time":"2012-12-03T20:49:11Z","timestamp":1354567751000},"page":"275-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Incorporating Great Deluge with Harmony Search for Global Optimization Problems"],"prefix":"10.1007","author":[{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osama Nasif","family":"Ahmad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahamad Tajudin","family":"Khader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed A.","family":"Awadallah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,4]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/s13721-012-0013-7"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"M. A. Al-Betar, A. T. Khader, and F. Nadi. Selection mechanisms in memory consideration for examination timetabling with harmony search. In GECCO \u201910: Proceedings of Genetic and Evolutionary Computation Conference. ACM, Portland, Oregon, USA, July 7-11 2010.","DOI":"10.1145\/1830483.1830702"},{"key":"24_CR3","unstructured":"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."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1016\/j.amc.2011.11.095"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-011-1041-x","volume":"194","author":"M.A. Al-Betar","year":"2012","unstructured":"M.A. Al-Betar and A.T. Khader. A harmony search algorithm for university course timetabling. Annals of Operations Research, 194:1-29, 2012.","journal-title":"Annals of Operations Research"},{"key":"24_CR6","unstructured":"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."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"O. Alia, M. Al-Betar, R. Mandava, A. Khader. Data clustering using harmony search algorithm. Swarm, Evolutionary, and, Memetic Computing, pages 79-88, 2011.","DOI":"10.1007\/978-3-642-27242-4_10"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/978-3-642-27242-4_4"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/BIC-TA.2011.75"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Christian Blum and Andrea Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv., 35(3):268-308, 2003.","DOI":"10.1145\/937503.937505"},{"issue":"4","key":"24_CR11","doi-asserted-by":"crossref","first-page":"401","DOI":"10.3233\/FI-2009-157","volume":"95","author":"P. Chakraborty","year":"2009","unstructured":"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.","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"24_CR12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G. Dueck","year":"2005","unstructured":"G. Dueck. New optimization heuristics. Journal of computational physics, 104(1):86-92, 2005.","journal-title":"Journal of computational physics"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Z. Geem. State-of-the-art in the structure of harmony search algorithm. Recent Advances In Harmony Search Algorithm, pages 1-10, 2010.","DOI":"10.1007\/978-3-642-04317-8_1"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Z. W. Geem, J. H. Kim, and G. V. Loganathan. A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2):60-68, 2001.","DOI":"10.1177\/003754970107600201"},{"key":"24_CR15","unstructured":"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."},{"issue":"2","key":"24_CR16","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.amc.2007.09.004","volume":"198","author":"M. G. H. Omran","year":"2008","unstructured":"M. G. H. Omran and M. Mahdavi. Global-best harmony search. Applied Mathematics and Computation, 198(2):643-656, 2008.","journal-title":"Applied Mathematics and Computation"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1016\/j.amc.2010.01.088"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/2001858.2001890"},{"issue":"4","key":"24_CR19","doi-asserted-by":"crossref","first-page":"2826","DOI":"10.1016\/j.eswa.2009.09.008","volume":"37","author":"C.M. Wang","year":"2010","unstructured":"C.M.Wang and Y.F. Huang. Self-adaptive harmony search algorithm for optimization. Expert Systems with Applications, 37(4):2826-2837, 2010.","journal-title":"Expert Systems with Applications"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Xin Yao, Yong Liu, and Guangming Lin. Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2):82-102, 1999.","DOI":"10.1109\/4235.771163"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1038-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T05:25:52Z","timestamp":1676179552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1038-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,4]]},"ISBN":["9788132210375","9788132210382"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1038-2_24","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2012,12,4]]},"assertion":[{"value":"4 December 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}