{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T04:32:50Z","timestamp":1716611570993},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,28]],"date-time":"2013-06-28T00:00:00Z","timestamp":1372377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10489-013-0444-6","type":"journal-article","created":{"date-parts":[[2013,6,27]],"date-time":"2013-06-27T00:37:17Z","timestamp":1372293437000},"page":"44-53","source":"Crossref","is-referenced-by-count":24,"title":["Population based Local Search for university course timetabling problems"],"prefix":"10.1007","volume":"40","author":[{"given":"Anmar","family":"Abuhamdah","sequence":"first","affiliation":[]},{"given":"Masri","family":"Ayob","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[]},{"given":"Nasser R.","family":"Sabar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,28]]},"reference":[{"key":"444_CR1","first-page":"41","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"S Petrovic","year":"2004","unstructured":"Petrovic S, Burke E (2004) Educational timetabling. In: Handbook of scheduling: algorithms, models, and performance analysis, pp\u00a041\u201345"},{"issue":"2","key":"444_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf A (1999) A survey of automated timetabling. Artif Intell Rev 13(2):87\u2013127","journal-title":"Artif Intell Rev"},{"issue":"2","key":"444_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2298\/YJOR0302139B","volume":"13","author":"E Burke","year":"2003","unstructured":"Burke E, Bykov Y, Newall J, Petrovic S (2003) A time-predefined approach to course timetabling. Yugosl J Oper Res 13(2):139\u2013151. ISSN: 0354-0243, EISSN: 2334-6043","journal-title":"Yugosl J Oper Res"},{"key":"444_CR4","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/BFb0055883","volume-title":"Practice and theory of automated timetabling II","author":"MS Elmohamed","year":"1998","unstructured":"Elmohamed MS, Coddington P, Fox G (1998) A comparison of annealing techniques for academic course scheduling. In: Practice and theory of automated timetabling II. Springer, Berlin, pp 92\u2013112"},{"issue":"1","key":"444_CR5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0377-2217(94)90009-4","volume":"76","author":"D Costa","year":"1994","unstructured":"Costa D (1994) A tabu search algorithm for computing an operational timetable. Eur J Oper Res 76(1):98\u2013110","journal-title":"Eur J Oper Res"},{"issue":"4","key":"444_CR6","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/3468.769755","volume":"29","author":"A Schaerf","year":"1999","unstructured":"Schaerf A (1999) Local search techniques for large high school timetabling problems. IEEE Trans Syst Man Cybern, Part A, Syst Hum 29(4):368\u2013377","journal-title":"IEEE Trans Syst Man Cybern, Part A, Syst Hum"},{"issue":"3","key":"444_CR7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.ejor.2011.08.006","volume":"216","author":"NR Sabar","year":"2012","unstructured":"Sabar NR, Ayob M, Kendall G, Qu R (2012) A honey-bee mating optimization algorithm for educational timetabling problems. Eur J Oper Res 216(3):533\u2013543","journal-title":"Eur J Oper Res"},{"issue":"1","key":"444_CR8","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/s10489-011-0317-9","volume":"37","author":"D Ayvaz","year":"2012","unstructured":"Ayvaz D, Topcuoglu H, Gurgen F (2012) Performance evaluation of evolutionary heuristics in dynamic environments. Appl Intell 37(1):130\u2013144. doi: 10.1007\/s10489-011-0317-9","journal-title":"Appl Intell"},{"key":"444_CR9","author":"K Lwin","year":"2013","unstructured":"Lwin K, Qu R (2013) A hybrid algorithm for constrained portfolio selection problems. Appl Intell. doi: 10.1007\/s10489-012-0411-7 , pp\u00a01\u201316","journal-title":"Appl Intell"},{"issue":"3","key":"444_CR10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10489-012-0375-7","volume":"38","author":"H Rajabalipour Cheshmehgaz","year":"2013","unstructured":"Rajabalipour Cheshmehgaz H, Desa M, Wibowo A (2013) Effective local evolutionary searches distributed on an island model solving bi-objective optimization problems. Appl Intell 38(3):331\u2013356. doi: 10.1007\/s10489-012-0375-7","journal-title":"Appl Intell"},{"issue":"16","key":"444_CR11","first-page":"2516","volume":"5","author":"A Abuhamdah","year":"2010","unstructured":"Abuhamdah A, Ayob M (2010) Adaptive randomized descent algorithm for solving course timetabling problems. Int J Phys Sci 5(16):2516\u20132522","journal-title":"Int J Phys Sci"},{"key":"444_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/DMO.2009.5341917","volume-title":"2nd conference on data mining and optimization, 2009","author":"A Abuhamdah","year":"2009","unstructured":"Abuhamdah A, Ayob M (2009) Multi-neighbourhood particle collision algorithm for solving course timetabling problems. In: 2nd conference on data mining and optimization, 2009. DMO\u201909. IEEE Press, New York, 21\u201327"},{"key":"444_CR13","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/DMO.2011.5976523","volume-title":"3rd conference on data mining and optimization (DMO)","author":"A Abuhamdah","year":"2011","unstructured":"Abuhamdah A, Ayob M (2011) MPCA-ARDA for solving course timetabling problems. In: 3rd conference on data mining and optimization (DMO). IEEE Press, New York, pp 171\u2013177"},{"issue":"3","key":"444_CR14","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268\u2013308","journal-title":"ACM Comput Surv"},{"key":"444_CR15","unstructured":"Webster BL (2004) Solving combinatorial optimization problems using a new algorithm based on gravitational attraction. PhD thesis, College of Engineering at Florida Institute of Technology"},{"key":"444_CR16","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of metaheuristics","author":"EK Burke","year":"2010","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Woodward JR (2010) A classification of hyper-heuristic approaches. In: Handbook of metaheuristics. Springer, Berlin, pp 449\u2013468"},{"issue":"3","key":"444_CR17","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/TEVC.2011.2160401","volume":"16","author":"EK Burke","year":"2012","unstructured":"Burke EK, Hyde MR, Kendall G (2012) Grammatical evolution of local search heuristics. IEEE Trans Evol Comput 16(3):406\u2013417","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"444_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1162\/EVCO_a_00063","volume":"20","author":"Z Ren","year":"2012","unstructured":"Ren Z, Jiang H, Xuan J, Luo Z (2012) Hyper-heuristics with low level parameter adaptation. Evol Comput 20(2):189\u2013227","journal-title":"Evol Comput"},{"issue":"1","key":"444_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10489-011-0309-9","volume":"37","author":"N Sabar","year":"2012","unstructured":"Sabar N, Ayob M, Qu R, Kendall G (2012) A graph coloring constructive hyper-heuristic for examination timetabling problems. Appl Intell 37(1):1\u201311. doi: 10.1007\/s10489-011-0309-9","journal-title":"Appl Intell"},{"key":"444_CR20","author":"A Soghier","year":"2013","unstructured":"Soghier A, Qu R (2013) Adaptive selection of heuristics for assigning time slots and rooms in exam timetables. Appl Intell. doi: 10.1007\/s10489-013-0422-z","journal-title":"Appl Intell"},{"key":"444_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Ant algorithms","author":"K Socha","year":"2002","unstructured":"Socha K, Knowles J, Sampels M (2002) A max-min ant system for the university course timetabling problem. In: Ant algorithms. Springer, Berlin, pp 1\u201313"},{"key":"444_CR22","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-36605-9_31","volume-title":"Applications of evolutionary computing","author":"K Socha","year":"2003","unstructured":"Socha K, Sampels M, Manfrin M (2003) Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In: Applications of evolutionary computing. Springer, Berlin, pp 334\u2013345"},{"issue":"5","key":"444_CR23","doi-asserted-by":"crossref","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 (2006) An effective hybrid algorithm for university course timetabling. J Sched 9(5):403\u2013432","journal-title":"J Sched"},{"key":"444_CR24","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/978-3-540-72584-8_71","volume-title":"Computational science\u2014ICCS 2007","author":"P Mcmullan","year":"2007","unstructured":"Mcmullan P (2007) An extended implementation of the great deluge algorithm for course timetabling. In: Computational science\u2014ICCS 2007. Springer, Berlin, pp 538\u2013545"},{"key":"444_CR25","first-page":"8-11","volume-title":"4th international IEEE conference intelligent systems, 2008","author":"D Landa-Silva","year":"2008","unstructured":"Landa-Silva D, Obit JH (2008) Great deluge with non-linear decay rate for solving course timetabling problems. In: 4th international IEEE conference intelligent systems, 2008. IS\u201908. IEEE Press, New York, pp 8-11\u20138-18"},{"key":"444_CR26","author":"R Abbasian","year":"2013","unstructured":"Abbasian R, Mouhoub M (2013) A hierarchical parallel genetic approach for the graph coloring problem. Appl Intell. doi: 10.1007\/s10489-013-0429-5 , pp\u00a01\u201319","journal-title":"Appl Intell"},{"key":"444_CR27","unstructured":"Abdullah S (2006) Heuristic approaches for university timetabling problems. PhD thesis, School of Computer Science, The University of Nottingham"},{"issue":"1","key":"444_CR28","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02601641","volume":"63","author":"JM Thompson","year":"1996","unstructured":"Thompson JM, Dowsland KA (1996) Variants of simulated annealing for the examination timetabling problem. Ann Oper Res 63(1):105\u2013128","journal-title":"Ann Oper Res"},{"key":"444_CR29","series-title":"The Morgan Kaufmann series in artificial intelligence","volume-title":"Stochastic local search: foundations & applications","author":"HH Hoos","year":"2004","unstructured":"Hoos HH, St\u00fctzle T (2004) In: Stochastic local search: foundations & applications. The Morgan Kaufmann series in artificial intelligence"},{"key":"444_CR30","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/978-3-642-16248-0_80","volume-title":"Rough set and knowledge technology","author":"H Turabieh","year":"2010","unstructured":"Turabieh H, Abdullah S, McCollum B, McMullan P (2010) Fish swarm intelligent algorithm for the course timetabling problem. In: Rough set and knowledge technology. Springer, Berlin, pp\u00a0588\u2013595"},{"key":"444_CR31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/DMO.2009.5341901","volume-title":"2nd conference on data mining and optimization, 2009","author":"H Turabieh","year":"2009","unstructured":"Turabieh H, Abdullah S (2009) Incorporating tabu search into memetic approach for enrolment-based course timetabling problems. In: 2nd conference on data mining and optimization, 2009. DMO\u201909. IEEE Press, New York, pp 115\u2013119"},{"key":"444_CR32","first-page":"413","volume-title":"The 2nd multidisciplinary international conference on scheduling: theory and applications (MISTA)","author":"S Abdullah","year":"2005","unstructured":"Abdullah S, Burke EK, Mccollum B (2005) An investigation of variable neighbourhood search for university course timetabling. In: The 2nd multidisciplinary international conference on scheduling: theory and applications (MISTA), pp 413\u2013427"},{"key":"444_CR33","doi-asserted-by":"crossref","unstructured":"Abdullah S, Turabieh H (2009) Electromagnetic like mechanism and great deluge for course timetabling problems. Paper presented at the first 2008 seminar on data mining and optimization DMO","DOI":"10.1007\/978-3-642-04918-7_5"},{"key":"444_CR34","doi-asserted-by":"crossref","first-page":"1764","DOI":"10.1109\/CEC.2007.4424686","volume-title":"IEEE Congress on evolutionary computation, 2007","author":"S Abdullah","year":"2007","unstructured":"Abdullah S, Burke EK, McCollum B (2007) A\u00a0hybrid evolutionary approach to the university course timetabling problem. In: IEEE Congress on evolutionary computation, 2007. CEC. IEEE Press, New York, pp\u00a01764\u20131768."},{"key":"444_CR35","doi-asserted-by":"crossref","first-page":"3095","DOI":"10.1109\/ICAL.2007.4339114","volume-title":"2007 IEEE international conference on automation and logistics, 2007","author":"N Ejaz","year":"2007","unstructured":"Ejaz N, Javed MY (2007) A hybrid approach for course scheduling inspired by die-hard co-operative ant behavior. In: 2007 IEEE international conference on automation and logistics, 2007. IEEE Press, New York, pp 3095\u20133100"},{"key":"444_CR36","volume-title":"Proceedings of the 5th United Kingdom workshop on computational intelligence (UKCI 2005)","author":"H Asmuni","year":"2005","unstructured":"Asmuni H, Burke EK, Garibaldi JM (2005) Fuzzy multiple heuristic ordering for course timetabling. In: Proceedings of the 5th United Kingdom workshop on computational intelligence (UKCI 2005), pp\u00a0302\u2013309. Citeseer"},{"key":"444_CR37","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/ICCIT.2008.379","volume-title":"Third international conference on convergence and hybrid information technology, 2008","author":"S Abdullah","year":"2008","unstructured":"Abdullah S, Turabieh H (2008) Generating university course timetable using genetic algorithms and local search. In: Third international conference on convergence and hybrid information technology, 2008. ICCIT\u201908. IEEE Press, New York, pp\u00a0254\u2013260"},{"key":"444_CR38","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-0-387-71921-4_8","volume-title":"Metaheuristics","author":"S Abdullah","year":"2007","unstructured":"Abdullah S, Burke EK, McCollum B (2007) Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem. In: Metaheuristics. Springer, Berlin, pp 153\u2013169"},{"issue":"1","key":"444_CR39","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A\u00a0graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176(1):177\u2013192","journal-title":"Eur J Oper Res"},{"issue":"6","key":"444_CR40","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"EK Burke","year":"2003","unstructured":"Burke EK, Kendall G, Soubeiga E (2003) A tabu-search hyperheuristic for timetabling and rostering. J Heuristics 9(6):451\u2013470","journal-title":"J Heuristics"},{"key":"444_CR41","volume-title":"7th international conference on the practice and theory of automated timetabling (PATAT 2008)","author":"MA Al-Betar","year":"2008","unstructured":"Al-Betar MA, Khader AT, Gani TA (2008) A\u00a0harmony search algorithm for university course timetabling. In: 7th international conference on the practice and theory of automated timetabling (PATAT 2008), Montreal, Canada, August 18\u201322."},{"key":"444_CR42","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-3-642-02319-4_32","volume-title":"Hybrid artificial intelligence systems","author":"D Landa-Silva","year":"2009","unstructured":"Landa-Silva D, Obit JH (2009) Evolutionary non-linear great deluge for university course timetabling. In: Hybrid artificial intelligence systems. Springer, Berlin, pp 269\u2013276"},{"key":"444_CR43","first-page":"1","volume-title":"MIC 2009: the VIII metaheuristics international conference","author":"J Obit","year":"2009","unstructured":"Obit J, Landa-Silva D, Ouelhadj D, Sevaux M (2009) Non-linear great deluge with learning mechanism for solving the course timetabling problem. In: MIC 2009: the VIII metaheuristics international conference, Hamburg, Germany, pp 1\u201310"},{"key":"444_CR44","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-642-04317-8_13","volume-title":"Recent advances in harmony search algorithm","author":"MA Al-Betar","year":"2010","unstructured":"Al-Betar MA, Khader AT, Liao IY (2010) A harmony search with multi-pitch adjusting rate for the university course timetabling. In: Recent advances in harmony search algorithm. Springer, Berlin, pp 147\u2013161"},{"key":"444_CR45","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-642-17622-7_17","volume-title":"Database theory and application, bio-science and bio-technology","author":"GM Jaradat","year":"2010","unstructured":"Jaradat GM, Ayob M (2010) An elitist-ant system for solving the post-enrolment course timetabling problem. In: Database theory and application, bio-science and bio-technology. Springer, Berlin, pp 167\u2013176"},{"key":"444_CR46","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-642-17622-7_6","volume-title":"Database theory and application, bio-science and bio-technology","author":"K Shaker","year":"2010","unstructured":"Shaker K, Abdullah S (2010) Controlling multi algorithms using round robin for university course timetabling problem. In: Database theory and application, bio-science and bio-technology. Springer, Berlin, pp 47\u201355"},{"issue":"10","key":"444_CR47","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf Sci 180(10):2044\u20132064","journal-title":"Inf Sci"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0444-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-013-0444-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0444-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T08:42:08Z","timestamp":1563266528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-013-0444-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,28]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["444"],"URL":"https:\/\/doi.org\/10.1007\/s10489-013-0444-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,28]]}}}