{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:31Z","timestamp":1767340291021,"version":"3.37.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043161"},{"type":"electronic","value":"9783642043178"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-04317-8_13","type":"book-chapter","created":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T05:54:48Z","timestamp":1263275688000},"page":"147-161","source":"Crossref","is-referenced-by-count":40,"title":["A Harmony Search with Multi-pitch Adjusting Rate for the University Course Timetabling"],"prefix":"10.1007","author":[{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"first","affiliation":[]},{"given":"Ahamad Tajudin","family":"Khader","sequence":"additional","affiliation":[]},{"given":"Iman Yi","family":"Liao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1093\/comjnl\/40.9.565","volume":"40","author":"E.K. Burke","year":"1997","unstructured":"Burke, E.K., Jackson, K., Kingston, J.H., Weare, R.: Automated university timetabling: The state of the art. The Computer Journal\u00a040, 565\u2013571 (1997)","journal-title":"The Computer Journal"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A.: A Survey of Automated Timetabling. Artif. Intelli. Rev.\u00a013, 87\u2013127 (1999)","journal-title":"Artif. Intelli. Rev."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/12.4.317","volume":"12","author":"D. Wood","year":"1969","unstructured":"Wood, D.: A technique for colouring a graph applicable to large scale timetabling problems. The Computer Journal\u00a012, 317\u2013319 (1969)","journal-title":"The Computer Journal"},{"key":"13_CR4","unstructured":"Asmuni, H., Burke, E.K., Garibaldi, J.: Fuzzy Multiple Heuristic Ordering for Course Timetabling. In: al-SMAe (ed.) Proceedings of the 5th United Kingdom Workshop on Computational Intelligence (UKCI 2005), London, UK, pp. 302\u2013309 (2005)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Burke, E.K., McCollum, B.: A Hybrid Evolutionary Approach to the University Course Timetabling Problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, Singapore, September 2007, pp. 1764\u20131768 (2007)","DOI":"10.1109\/CEC.2007.4424686"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Kendall, G., Soubeiga, E.: A Tabu-Search Hyperheuristic for Timetabling and Rostering. Journal of Heuristics\u00a09, 451\u2013470 (2003)","journal-title":"Journal of Heuristics"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E.K. Burke","year":"2007","unstructured":"Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper-heuristic for educational timetabling problems. Eur. J. Opl. Res.\u00a0176, 177\u2013192 (2007)","journal-title":"Eur. J. Opl. Res."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Lewis, R., Paechter, B., Rossi-Doria, O.: Metaheuristics for University Course Timetabling, Ph.D. Thesis (August 2006)","DOI":"10.1007\/978-3-540-48584-1_9"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R. Lewis","year":"2008","unstructured":"Lewis, R.: A survey of metaheuristic-based techniques for University Timetabling problems. OR Spectrum\u00a030, 167\u2013190 (2008)","journal-title":"OR Spectrum"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv.\u00a035, 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"key":"13_CR11","unstructured":"Lewis, R., Paechter, B.: New crossover operators for timetabling with evolutionary algorithms. In: Lofti, A. (ed.) The fifth international conference on recent advances in soft computing (RASC 2004), Nottingham, England, pp. 189\u2013194 (2004)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Ant Algorithms","author":"K. Socha","year":"2002","unstructured":"Socha, K., Joshua, K., Michael, S.: A MAX-MIN Ant System for the University Course Timetabling Problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 1\u201313. Springer, Heidelberg (2002)"},{"key":"13_CR13","unstructured":"Malim, M.R., Khader, A.T., Mustafa, A.: Artificial Immune Algorithms for University Timetabling. In: Burke, E.K., Rudova, H. (eds.) The 6th International Conference on Practice and Theory of Automated Timetabling, Brno, Czech Republic, pp. 234\u2013245 (2006)"},{"key":"13_CR14","unstructured":"Al-Betar, M.A., Khader, A.T., Gani, T.A.: A harmony search algorithm for university course timetabling. In: 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008), Montreal, Canada, August 18-22 (2008)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02601641","volume":"63","author":"J. Thompson","year":"1996","unstructured":"Thompson, J., Dowsland, K.: Variants of simulated annealing for the examination timetabling problem. Annals of Operations Research\u00a063, 105\u2013128 (1996)","journal-title":"Annals of Operations Research"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10951-006-8495-8","volume":"9","author":"M. Chiarandini","year":"2006","unstructured":"Chiarandini, M., Birattari, M., Socha, K., Rossi-Doria, O.: An effective hybrid algorithm for university course timetabling. J. of Scheduling\u00a09, 403\u2013432 (2006)","journal-title":"J. of Scheduling"},{"key":"13_CR17","unstructured":"Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., Paechter, B.: A local search for the timetabling problem. In: Proceedings of the 4th International Conference on the Practice And Theory of Automated Timetabling (PATAT 2002), August 2002, pp. 124\u2013127 (2002)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Burke, E., McCollum, B.: Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem. Metaheuristics, 153\u2013169 (2007)","DOI":"10.1007\/978-0-387-71921-4_8"},{"key":"13_CR19","unstructured":"Abdullah, S., Burke, E.K., McCollum, B.: An Investigation of Variable Neighbourhood Search for University Course Timetabling. In: Proceedings of the 2nd Multidisciplinary Conference on Scheduling: Theory and Applications (MISTA), New York, USA, pp. 413\u2013427 (2005)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Landa-Silva, D., Obit, J.H.: Great deluge with non-linear decay rate for solving course timetabling problems Intelligent Systems. In: Proceedings of the 4th International IEEE Conference on Intelligent Systems, pp. 8-11-18-18 (2008)","DOI":"10.1109\/IS.2008.4670447"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-540-72584-8_71","volume-title":"Computational Science \u2013 ICCS 2007","author":"P. McMullan","year":"2007","unstructured":"McMullan, P.: An extended implementation of the great deluge algorithm for course timetabling. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol.\u00a04487, pp. 538\u2013545. Springer, Heidelberg (2007)"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R. Qu","year":"2009","unstructured":"Qu, R., Burke, E.K., McCullom, B., Merlot, L.T.G., Lee, S.Y.: A survey of search methodologies and automated approaches for examination timetabling. Journal of Scheduling\u00a012, 55\u201389 (2009)","journal-title":"Journal of Scheduling"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Turabieh, H.: Generating university course timetable using genetic algorithms and local search. In: The Third 2008 International Conference on Convergence and Hybrid Information Technology (ICCIT), pp. 254\u2013260 (2008)","DOI":"10.1109\/ICCIT.2008.379"},{"key":"13_CR24","unstructured":"Al-Betar, M.A., Khader, A.: A hybrid harmony search for university course timetabling. In: Proceedings of the 4nd Multidisciplinary Conference on Scheduling: Theory and Applications (MISTA 2009), Dublin, Ireland, August 10-12, pp. 157\u2013179 (2009)"},{"key":"13_CR25","series-title":"LNAI","first-page":"269","volume-title":"HAIS 2009","author":"D. Landa-Silva","year":"2009","unstructured":"Landa-Silva, D., Obit, J.: Evolutionary Non-linear Great Deluge for University Course Timetabling. In: Corchado, E., et al. (eds.) HAIS 2009. LNCS (LNAI), vol.\u00a05572, pp. 269\u2013276. Springer, Heidelberg (2009)"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BFb0055878","volume-title":"Practice and Theory of Automated Timetabling II","author":"M.W. Carter","year":"1998","unstructured":"Carter, M.W., Laporte, G.: Recent developments in practical course timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol.\u00a01408, pp. 3\u201319. Springer, Heidelberg (1998)"},{"key":"13_CR27","unstructured":"Al-Betar, M.A., Khader, A.: A Harmony Search Algorithm for University Course Timetabling. Annals of Operations Research (to appear)"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"Z.W. Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation\u00a076, 60\u201368 (2001)","journal-title":"Simulation"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of 6th International Symposium on Micro Machine and Human Science (MHS 1995), pp. 39\u201343 (1995)","DOI":"10.1109\/MHS.1995.494215"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/j.compstruc.2004.01.002","volume":"82","author":"K.S. Lee","year":"2004","unstructured":"Lee, K.S., Geem, Z.W.: A new structural optimization method based on the harmony search algorithm. Computers & Structures\u00a082, 781\u2013798 (2004)","journal-title":"Computers & Structures"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Obit, J.H., Landa-Silva, D., Ouelhadj, D., Sevaux, M.: Non-Linear Great Deluge with Learning Mechanism for Solving the Course Timetabling Problem. In: The 8th Metaheuristics International Conference (MIC 2009), Hamburg, Germany (July 2009)","DOI":"10.1109\/IS.2008.4670447"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-3-642-02962-2_63","volume-title":"RSKT 2009","author":"H. Turabieh","year":"2009","unstructured":"Turabieh, H., Abdullah, S., McCollum, B.: Electromagnetism-like Mechanism with Force Decay Rate Great Deluge for the Course Timetabling Problem. In: RSKT 2009. LNCS, vol.\u00a05589, pp. 497\u2013504. Springer, Heidelberg (2009)"}],"container-title":["Studies in Computational Intelligence","Recent Advances In Harmony Search Algorithm"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04317-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,16]],"date-time":"2025-02-16T16:48:33Z","timestamp":1739724513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04317-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642043161","9783642043178"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04317-8_13","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2010]]}}}