{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T02:10:29Z","timestamp":1741918229550,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255656"},{"type":"electronic","value":"9783642255663"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25566-3_42","type":"book-chapter","created":{"date-parts":[[2011,11,14]],"date-time":"2011-11-14T09:19:51Z","timestamp":1321262391000},"page":"539-551","source":"Crossref","is-referenced-by-count":14,"title":["A Hybrid Fish Swarm Optimisation Algorithm for Solving Examination Timetabling Problems"],"prefix":"10.1007","author":[{"given":"Hamza","family":"Turabieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salwani","family":"Abdullah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Abdullah, S., Burke, E.K.: A Multi-start large neighbourhood search approach with local search methods for examination timetabling. In: International Conference on Automated Planning and Scheduling (ICAPS 2006), Cumbria, UK, pp. 334\u2013337 (2006)"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-12139-5_1","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"S. Abdullah","year":"2010","unstructured":"Abdullah, S., Shaker, K., McCollum, B., McMullan, P.: Dual sequence simulated annealing with round-robin approach for university course timetabling. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol.\u00a06022, pp. 1\u201310. Springer, Heidelberg (2010)"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Turabieh, H., Abdullah, S.: An integrated hybrid approach to the examination timetabling problem. OMEGA (2011), doi:10.1016\/j.omega.2010.12.005","DOI":"10.1016\/j.omega.2010.12.005"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-77345-0","volume-title":"Practice and Theory of Automated Timetabling VI","author":"E.K. Burke","year":"2007","unstructured":"Burke, E.K., Bykov, Y.: Solving exam timetabling problems with the flex-deluge algorithm. In: Burke, E.K., Rudov\u00e1, H. (eds.) PATAT 2007. LNCS, vol.\u00a03867, pp. 370\u2013372. Springer, Heidelberg (2007) ISBN: 80-210-3726-1"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2010.01.044","volume":"206","author":"E.K. Burke","year":"2010","unstructured":"Burke, E.K., Eckersley, A.J., McCollum, B., Petrovic, S., Qu, R.: Hybrid variable neighbourhood approaches to university exam timetabling. European Journal of Operational Research\u00a0206, 46\u201353 (2010)","journal-title":"European Journal of Operational Research"},{"key":"42_CR6","unstructured":"Burke, E.K., Kingston, J., de Werra, D.: Applications to timetabling. In: Gross, J., Yellen, J. (eds.) Handbook of Graph Theory, pp. 445\u2013474. Chapman Hall\/CRC Press (2004)"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44691-5_20","volume-title":"Algorithm Engineering","author":"M. Caramia","year":"2001","unstructured":"Caramia, M., Dell\u2019Olmo, P., Italiano, G.F.: New algorithms for examination timetabling. In: N\u00e4her, S., Wagner, D. (eds.) WAE 2000. LNCS, vol.\u00a01982, pp. 230\u2013241. Springer, Heidelberg (2001)"},{"issue":"3","key":"42_CR8","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"47","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W., Laporte, G., Lee, S.: Examination timetabling: Algorithmic strategies and applications. Journal of the Operational Research Society\u00a047(3), 373\u2013383 (1996)","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"42_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"M.W. Carter","year":"1986","unstructured":"Carter, M.W.: A survey of practical applications of examination timetabling algorithms. Operations Research\u00a034(2), 193\u2013202 (1986)","journal-title":"Operations Research"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-45157-0_15","volume-title":"Practice and Theory of Automated Timetabling IV","author":"S. Casey","year":"2003","unstructured":"Casey, S., Thompson, J.: GRASPing the examination scheduling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 232\u2013244. Springer, Heidelberg (2003)"},{"key":"42_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/11593577_17","volume-title":"Practice and Theory of Automated Timetabling V","author":"P. C\u00f4t\u00e9","year":"2005","unstructured":"C\u00f4t\u00e9, P., Wong, T., Sabourin, R.: A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 294\u2013312. Springer, Heidelberg (2005)"},{"issue":"4","key":"42_CR12","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1057\/palgrave.jors.2601830","volume":"56","author":"K. Dowsland","year":"2005","unstructured":"Dowsland, K., Thompson, J.: Ant colony optimization for the examination scheduling problem. Journal of the Operational Research Society\u00a056(4), 426\u2013438 (2005)","journal-title":"Journal of the Operational Research Society"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G. Dueck","year":"1993","unstructured":"Dueck, G.: New Optimization Heuristics. The great deluge algorithm and the record-to-record travel. Journal of Computational Physics\u00a0104, 86\u201392 (1993)","journal-title":"Journal of Computational Physics"},{"key":"42_CR14","unstructured":"Fernandes, E.M.G.P., Martins, T.F.M.C., Rocha, A.M.A.C.: Fish Swarm Intelligent Algorithm for Bound Constrained Global Optimization. In: Proceedings of the International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2009, June 30 , July 1-3 (2009)"},{"key":"42_CR15","unstructured":"Fox, M.S., Sadeh-Koniecpol, N.: Why is scheduling so difficult? A csp perspective. In: Proceedings of the European Conference on Artificial Intelligence, pp. 754\u2013767 (1990)"},{"key":"42_CR16","volume-title":"Swarm intelligence algorithms and applications","author":"S. Gao","year":"2006","unstructured":"Gao, S., Yang, J.Y.: Swarm intelligence algorithms and applications. China Waterpower Press, Beijing (2006)"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Gaspero, L.D., Schaerf, A.: Tabu search techniques for examination timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 104\u2013117. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44629-X_7"},{"key":"42_CR18","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-0-387-85437-3_12","volume-title":"Proceedings of the European Computing Conference","author":"M. Jiang","year":"2009","unstructured":"Jiang, M., Mastorakis, N., Yuan, D., Lagunas, M.A.: Image segmentation with improved artificial fish swarm algorithm. In: Mastorakis, N., Mladenov, V., Kontargyri, V.T. (eds.) Proceedings of the European Computing Conference. Lecture Notes in Electrical Engineering, vol.\u00a028, pp. 133\u2013138. Springer, Heidelberg (2009) ISBN: 978-0-387-84818-1"},{"key":"42_CR19","series-title":"CCIS","first-page":"1084","volume-title":"ICIC 2007","author":"M. Jiang","year":"2007","unstructured":"Jiang, M., Wang, Y., Pfletschinger, S., Lagunas, M.A., Yuan, D.: Optimal multiuser detection with artificial fish swarm algorithm. In: Huang, D.-S., Heutte, L., Loog, M. (eds.) ICIC 2007. CCIS, vol.\u00a02, pp. 1084\u20131093. Springer, Heidelberg (2007)"},{"issue":"1","key":"42_CR20","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(1), 167\u2013190 (2008)","journal-title":"OR Spectrum"},{"key":"42_CR21","first-page":"32","volume":"11","author":"X.L. Li","year":"2002","unstructured":"Li, X.L., Shao, Z.J., Qian, J.X.: An optimizing method based on autonomous animate: fish swarm algorithm. System Engineering Theory and Practice\u00a011, 32\u201338 (2002)","journal-title":"System Engineering Theory and Practice"},{"key":"42_CR22","series-title":"Lecture Notes in Computer Science","first-page":"234","volume-title":"Practice and Theory of Automated Timetabling VI","author":"M.R. Malim","year":"2007","unstructured":"Malim, M.R., Khader, A.T., Mustafa, A.: Artificial immune algorithms for university. In: Burke, E.K., Rudov\u00e1, H. (eds.) PATAT 2007. LNCS, vol.\u00a03867, pp. 234\u2013245. Springer, Heidelberg (2007)"},{"key":"42_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-77345-0_1","volume-title":"Practice and Theory of Automated Timetabling VI","author":"B. McCollum","year":"2007","unstructured":"McCollum, B.: A perspective on bridging the gap between theory and practice in university timetabling. In: Burke, E.K., Rudov\u00e1, H. (eds.) PATAT 2007. LNCS, vol.\u00a03867, pp. 3\u201323. Springer, Heidelberg (2007)"},{"key":"42_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-45157-0_14","volume-title":"Practice and Theory of Automated Timetabling IV","author":"L.T.G. Merlot","year":"2003","unstructured":"Merlot, L.T.G., Boland, N., Hughes, B.D., Stuckey, P.J.: A Hybrid Algorithm for the Examination Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 207\u2013231. Springer, Heidelberg (2003)"},{"key":"42_CR25","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J.A. Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Computer Journal\u00a07, 308\u2013313 (1965)","journal-title":"Computer Journal"},{"key":"42_CR26","volume-title":"Handbook of Scheduling: Algorithms Models and Performance Analysis","author":"S. Petrovic","year":"2004","unstructured":"Petrovic, S., Burke, E.K.: Chapter 45: University timetabling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms Models and Performance Analysis. CRC Press, Boca Raton (2004)"},{"issue":"2","key":"42_CR27","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ejor.2008.10.001","volume":"198","author":"R. Qu","year":"2009","unstructured":"Qu, R., Burke, E.K., McCollum, B.: Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems. European Journal of Operational Research (EJOR)\u00a0198(2), 392\u2013404 (2009)","journal-title":"European Journal of Operational Research (EJOR)"},{"key":"42_CR28","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1057\/jors.2008.102","volume":"60","author":"R. Qu","year":"2009","unstructured":"Qu, R., Burke, E.K.: Hybridisations within a graph based hyper-heuristic framework for university timetabling problems. Journal of Operational Research Society (JORS)\u00a060, 1273\u20131285 (2009)","journal-title":"Journal of Operational Research Society (JORS)"},{"key":"42_CR29","doi-asserted-by":"crossref","unstructured":"Qu, R., Burke, E.K., McCollum, B., Merlot, L.T.G., Lee, S.Y.: A survey of search methodologies and automated system development for examination timetabling. Journal of scheduling, 55\u201389 (2009)","DOI":"10.1007\/s10951-008-0077-5"},{"key":"42_CR30","first-page":"99","volume-title":"Intelligent Scheduling","author":"N. Sadeh","year":"1994","unstructured":"Sadeh, N., Kaujnunn, M.: Micro-opportunistic scheduling: The micro-boss factory scheduler. In: Intelligent Scheduling, pp. 99\u2013135. Morgan Kaufmann, San Francisco (1994)"},{"issue":"2","key":"42_CR31","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. Artificial Intelligence Review\u00a013(2), 87\u2013127 (1999)","journal-title":"Artificial Intelligence Review"},{"key":"42_CR32","doi-asserted-by":"crossref","unstructured":"Wang, C.-R., Zhou, C.-L., Ma, J.-W.: An improved artificial fish swarm algorithm and its application in feed-forward neural networks. In: Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, pp. 2890\u20132894 (2005)","DOI":"10.1109\/ICMLC.2005.1527436"},{"key":"42_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11942634_22","volume-title":"Frontiers of High Performance Computing and Networking \u2013 ISPA 2006 Workshops","author":"X. Wang","year":"2006","unstructured":"Wang, X., Gao, N., Cai, S., Huang, M.: An Artificial Fish Swarm Algorithm Based and ABC Supported QoS Unicast Routing Scheme in NGI. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., R\u00fcnger, G. (eds.) ISPA Workshops 2006. LNCS, vol.\u00a04331, pp. 205\u2013214. Springer, Heidelberg (2006)"},{"key":"42_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11593577_15","volume-title":"Practice and Theory of Automated Timetabling V","author":"Y. Yang","year":"2005","unstructured":"Yang, Y., Petrovic, S.: A Novel Similarity Measure for Heuristic Selection in Examination Timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 247\u2013269. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25566-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T01:41:48Z","timestamp":1741916508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25566-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255656","9783642255663"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25566-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}