{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T22:09:13Z","timestamp":1775167753200,"version":"3.50.1"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T00:00:00Z","timestamp":1597795200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T00:00:00Z","timestamp":1597795200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10489-020-01833-x","type":"journal-article","created":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T22:03:27Z","timestamp":1597874607000},"page":"467-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local search"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9075-9381","authenticated-orcid":false,"given":"Amin","family":"Rezaeipanah","sequence":"first","affiliation":[]},{"given":"Samaneh Sechin","family":"Matoori","sequence":"additional","affiliation":[]},{"given":"Gholamreza","family":"Ahmadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,19]]},"reference":[{"issue":"1","key":"1833_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4314\/njt.v39i1.1","volume":"39","author":"AM Hambali","year":"2020","unstructured":"Hambali AM, Olasupo YA, Dalhatu M (2020) Automated university lecture timetable using heuristic approach. Niger J Technol 39(1):1\u201314. https:\/\/doi.org\/10.4314\/njt.v39i1.1","journal-title":"Niger J Technol"},{"issue":"1","key":"1833_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10489-013-0444-6","volume":"40","author":"A Abuhamdah","year":"2014","unstructured":"Abuhamdah A, Ayob M, Kendall G, Sabar NR (2014) Population based local search for university course timetabling problems. Appl Intell 40(1):44\u201353. https:\/\/doi.org\/10.1007\/s10489-013-0444-6","journal-title":"Appl Intell"},{"key":"1833_CR3","doi-asserted-by":"publisher","unstructured":"Thepphakorn T, Pongcharoen P (2019) Variants and parameters investigations of particle swarm optimisation for solving course timetabling problems. In: International conference on swarm intelligence. Springer, Cham, pp 177\u2013187. https:\/\/doi.org\/10.1007\/978-3-030-26369-0_17","DOI":"10.1007\/978-3-030-26369-0_17"},{"issue":"11","key":"1833_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00521-020-05110-3","volume":"32","author":"A Bashab","year":"2020","unstructured":"Bashab A, Ibrahim AO, AbedElgabar EE, Ismail MA, Elsafi A, Ahmed A, Abraham A (2020) A systematic mapping study on solving university timetabling problems using meta-heuristic algorithms. Neural Comput & Applic 32(11):1\u201336. https:\/\/doi.org\/10.1007\/s00521-020-05110-3","journal-title":"Neural Comput & Applic"},{"key":"1833_CR5","doi-asserted-by":"publisher","unstructured":"Pint\u00e9r M, D\u00e1vid B (2019) A two-stage heuristic for the university course timetabling problem. In: Proceedings of the 2019 6th student computer science research conference-StuCoSReC. Univerza na Primorskem, In\u0161titut Andrej Maru\u0161i\u010d, pp 27\u201330. https:\/\/doi.org\/10.26493\/978-961-7055-82-5.27-30","DOI":"10.26493\/978-961-7055-82-5.27-30"},{"key":"1833_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.cor.2017.09.007","volume":"90","author":"C Akkan","year":"2018","unstructured":"Akkan C, G\u00fclc\u00fc A (2018) A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem. Comput Oper Res 90:22\u201332. https:\/\/doi.org\/10.1016\/j.cor.2017.09.007","journal-title":"Comput Oper Res"},{"key":"1833_CR7","unstructured":"Kostuch P (2003) Timetabling competition-SA-based heuristic. International Timetabling Competition. http:\/\/www.idsia.ch\/ttcomp2002\/docs"},{"issue":"1","key":"1833_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10479-013-1321-8","volume":"218","author":"N Pillay","year":"2014","unstructured":"Pillay N (2014) A survey of school timetabling research. Ann Oper Res 218(1):261\u2013293. https:\/\/doi.org\/10.1007\/s10479-013-1321-8","journal-title":"Ann Oper Res"},{"issue":"1","key":"1833_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ejor.2017.07.029","volume":"265","author":"L Saviniec","year":"2018","unstructured":"Saviniec L, Santos MO, Costa AM (2018) Parallel local search algorithms for high school timetabling problems. Eur J Oper Res 265(1):81\u201398. https:\/\/doi.org\/10.1016\/j.ejor.2017.07.029","journal-title":"Eur J Oper Res"},{"issue":"5","key":"1833_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.26438\/ijsrcse\/v7i5.513","volume":"7","author":"A Rezaeipanah","year":"2019","unstructured":"Rezaeipanah A, Abshirini Z, Zade MB (2019) Solving University course timetabling problem using parallel genetic algorithm. International Journal of Scientific Research in Computer Science and Engineering 7(5):5\u201313","journal-title":"International Journal of Scientific Research in Computer Science and Engineering"},{"issue":"1","key":"1833_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.26594\/register.v6i1.1663","volume":"6","author":"AM Fajrin","year":"2020","unstructured":"Fajrin AM, Fatichah C (2020) Multi-parent order crossover mechanism of genetic algorithm for minimizing violation of soft constraint on course timetabling problem. Register: Jurnal Ilmiah Teknologi Sistem Informasi 6(1):43\u201351. https:\/\/doi.org\/10.26594\/register.v6i1.1663","journal-title":"Register: Jurnal Ilmiah Teknologi Sistem Informasi"},{"issue":"2","key":"1833_CR12","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10489-013-0422-z","volume":"39","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 39(2):438\u2013450. https:\/\/doi.org\/10.1007\/s10489-013-0422-z","journal-title":"Appl Intell"},{"issue":"2","key":"1833_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10489-009-0196-5","volume":"34","author":"N Mansour","year":"2011","unstructured":"Mansour N, Isahakian V, Ghalayini I (2011) Scatter search technique for exam timetabling. Appl Intell 34(2):299\u2013310. https:\/\/doi.org\/10.1007\/s10489-009-0196-5","journal-title":"Appl Intell"},{"key":"1833_CR14","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.procs.2018.08.024","volume":"126","author":"M Assi","year":"2018","unstructured":"Assi M, Halawi B, Haraty RA (2018) Genetic algorithm analysis using the graph coloring method for solving the university timetable problem. Procedia Computer Science 126:899\u2013906. https:\/\/doi.org\/10.1016\/j.procs.2018.08.024","journal-title":"Procedia Computer Science"},{"issue":"1","key":"1833_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/s40815-017-0296-z","volume":"20","author":"H Babaei","year":"2018","unstructured":"Babaei H, Karimpour J, Hadidi A (2018) Applying hybrid fuzzy multi-criteria decision-making approach to find the best ranking for the soft constraint weights of lecturers in UCTP. International Journal of Fuzzy Systems 20(1):62\u201377. https:\/\/doi.org\/10.1007\/s40815-017-0296-z","journal-title":"International Journal of Fuzzy Systems"},{"key":"1833_CR16","doi-asserted-by":"publisher","unstructured":"June TL, Obit JH, Leau YB, Bolongkikit J, Alfred R (2020) Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem. In: Computational science and technology. Springer, Singapore, pp 257\u2013267. https:\/\/doi.org\/10.1007\/978-981-15-0058-9_25","DOI":"10.1007\/978-981-15-0058-9_25"},{"issue":"2","key":"1833_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10479-015-2094-z","volume":"252","author":"AE Phillips","year":"2017","unstructured":"Phillips AE, Walker CG, Ehrgott M, Ryan DM (2017) Integer programming for minimal perturbation problems in university course timetabling. Ann Oper Res 252(2):283\u2013304. https:\/\/doi.org\/10.1007\/s10479-015-2094-z","journal-title":"Ann Oper Res"},{"issue":"11","key":"1833_CR18","doi-asserted-by":"publisher","first-page":"366","DOI":"10.5539\/mas.v12n11p366","volume":"12","author":"I AlHadid","year":"2018","unstructured":"AlHadid I, Kaabneh K, Tarawneh H (2018) Hybrid simulated annealing with meta-heuristic methods to solve UCT problem. Mod Appl Sci 12(11):366\u2013375. https:\/\/doi.org\/10.5539\/mas.v12n11p366","journal-title":"Mod Appl Sci"},{"key":"1833_CR19","doi-asserted-by":"publisher","unstructured":"Abdullah S, Burke EK, McCollum B (2007) A hybrid evolutionary approach to the university course timetabling problem. In: 2007 IEEE congress on evolutionary computation, pp 1764\u20131768. https:\/\/doi.org\/10.1109\/CEC.2007.4424686","DOI":"10.1109\/CEC.2007.4424686"},{"issue":"1","key":"1833_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/TSMCC.2010.2049200","volume":"41","author":"S Yang","year":"2010","unstructured":"Yang S, Jat SN (2010) Genetic algorithms with guided and local search strategies for university course timetabling. IEEE Trans Syst Man Cybern Part C Appl Rev 41(1):93\u2013106. https:\/\/doi.org\/10.1109\/TSMCC.2010.2049200","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"key":"1833_CR21","doi-asserted-by":"publisher","unstructured":"Landa-Silva D, Obit JH (2009) Evolutionary non-linear great deluge for university course timetabling. In: International conference on hybrid artificial intelligence systems. Springer, Berlin, pp 269\u2013276. https:\/\/doi.org\/10.1007\/978-3-642-02319-4_32","DOI":"10.1007\/978-3-642-02319-4_32"},{"key":"1833_CR22","doi-asserted-by":"publisher","unstructured":"Turabieh H, Abdullah S, Mccollum B (2009) Electromagnetism-like mechanism with force decay rate great deluge for the course timetabling problem. In: International conference on rough sets and knowledge technology. Springer, Berlin, pp 497\u2013504. https:\/\/doi.org\/10.1007\/978-3-642-02962-2_63","DOI":"10.1007\/978-3-642-02962-2_63"},{"issue":"105007","key":"1833_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2020.105007","volume":"123","author":"M Chen","year":"2020","unstructured":"Chen M, Tang X, Song T, Wu C, Liu S, Peng X (2020) A Tabu search algorithm with controlled randomization for constructing feasible university course timetables. Comput Oper Res 123(105007):1\u201331. https:\/\/doi.org\/10.1016\/j.cor.2020.105007","journal-title":"Comput Oper Res"},{"issue":"5","key":"1833_CR24","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1109\/TSMCC.2011.2174356","volume":"42","author":"MA Al-Betar","year":"2012","unstructured":"Al-Betar MA, Khader AT, Zaman M (2012) University course timetabling using a hybrid harmony search metaheuristic algorithm. IEEE Trans Syst Man Cybern Part C Appl Rev 42(5):664\u2013681. https:\/\/doi.org\/10.1109\/TSMCC.2011.2174356","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"key":"1833_CR25","unstructured":"Paechter B (2002) A local search for the timetabling problem. In: Proceedings of the 4th international conference on the practice and theory of automated timetabling. PATAT, pp 21\u201323"},{"issue":"1","key":"1833_CR26","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T M\u00fcller","year":"2009","unstructured":"M\u00fcller T (2009) ITC2007 solver description: a hybrid approach. Ann Oper Res 172(1):429\u2013446. https:\/\/doi.org\/10.1007\/s10479-009-0644-y","journal-title":"Ann Oper Res"},{"key":"1833_CR27","unstructured":"Wahid J (2017) Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling. In: The doctoral research abstracts, Institute of Graduate Studies, UiTM, Shah Alam 11(11). http:\/\/ir.uitm.edu.my\/id\/eprint\/19762"},{"issue":"1","key":"1833_CR28","doi-asserted-by":"publisher","first-page":"72","DOI":"10.11591\/ijeecs.v13.i1.pp72-76","volume":"13","author":"M Mazlan","year":"2019","unstructured":"Mazlan M, Makhtar M, Khairi AFKA, Mohamed MA (2019) University course timetabling model using ant colony optimization algorithm approach. Indonesian Journal of Electrical Engineering and Computer Science 13(1):72\u201376. https:\/\/doi.org\/10.11591\/ijeecs.v13.i1.pp72-76","journal-title":"Indonesian Journal of Electrical Engineering and Computer Science"},{"key":"1833_CR29","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.eswa.2019.02.026","volume":"127","author":"SI Hossain","year":"2019","unstructured":"Hossain SI, Akhand MAH, Shuvo MIR, Siddique N, Adeli H (2019) Optimization of university course scheduling problem using particle swarm optimization with selective search. Expert Syst Appl 127:9\u201324. https:\/\/doi.org\/10.1016\/j.eswa.2019.02.026","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1833_CR30","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1002\/tee.23067","volume":"15","author":"AA Gozali","year":"2020","unstructured":"Gozali AA, Kurniawan B, Weng W, Fujimura S (2020) Solving university course timetabling problem using localized island model genetic algorithm with dual dynamic migration policy. IEEJ Trans Electr Electron Eng 15(3):389\u2013400. https:\/\/doi.org\/10.1002\/tee.23067","journal-title":"IEEJ Trans Electr Electron Eng"},{"issue":"11","key":"1833_CR31","doi-asserted-by":"publisher","first-page":"11413","DOI":"10.1166\/asl.2017.10295","volume":"23","author":"KY Junn","year":"2017","unstructured":"Junn KY, Obit JH, Alfred R (2017) Comparison of simulated annealing and great deluge algorithms for university course timetabling problems (UCTP). Adv Sci Lett 23(11):11413\u201311417. https:\/\/doi.org\/10.1166\/asl.2017.10295","journal-title":"Adv Sci Lett"},{"issue":"6","key":"1833_CR32","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1080\/01605682.2018.1468862","volume":"70","author":"SL Goh","year":"2019","unstructured":"Goh SL, Kendall G, Sabar NR (2019) Simulated annealing with improved reheating and learning for the post enrolment course timetabling problem. J Oper Res Soc 70(6):873\u2013888. https:\/\/doi.org\/10.1080\/01605682.2018.1468862","journal-title":"J Oper Res Soc"},{"key":"1833_CR33","doi-asserted-by":"publisher","unstructured":"Yusoff M, Roslan N (2019) Evaluation of genetic algorithm and hybrid genetic Algorithm-Hill climbing with elitist for Lecturer University timetabling problem. In: International conference on swarm intelligence. Springer, Cham, pp 363\u2013373. https:\/\/doi.org\/10.1007\/978-3-030-26369-0_34","DOI":"10.1007\/978-3-030-26369-0_34"},{"issue":"16","key":"1833_CR34","doi-asserted-by":"publisher","first-page":"28","DOI":"10.4236\/jcc.2016.416003","volume":"4","author":"T Islam","year":"2016","unstructured":"Islam T, Shahriar Z, Perves MA, Hasan M (2016) University timetable generator using tabu search. Journal of Computer and Communications 4(16):28\u201337. https:\/\/doi.org\/10.4236\/jcc.2016.416003","journal-title":"Journal of Computer and Communications"},{"key":"1833_CR35","doi-asserted-by":"publisher","unstructured":"Susan S, Bhutani A (2018) Data mining with association rules for scheduling open elective courses using optimization algorithms. In: International conference on intelligent systems design and applications, Springer, Cham, pp 770\u2013778. https:\/\/doi.org\/10.1007\/978-3-030-16660-1_75","DOI":"10.1007\/978-3-030-16660-1_75"},{"issue":"3","key":"1833_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12597-020-00444-x","volume":"57","author":"SL Goh","year":"2020","unstructured":"Goh SL, Kendall G, Sabar NR, Abdullah S (2020) An effective hybrid local search approach for the post enrolment course timetabling problem. Opsearch 57(3):1\u201333. https:\/\/doi.org\/10.1007\/s12597-020-00444-x","journal-title":"Opsearch"},{"key":"1833_CR37","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.procs.2019.11.169","volume":"161","author":"A Muklason","year":"2019","unstructured":"Muklason A, Irianti RG, Marom A (2019) Automated course timetabling optimization using Tabu-variable neighborhood search based hyper-heuristic algorithm. Procedia Computer Science 161:656\u2013664. https:\/\/doi.org\/10.1016\/j.procs.2019.11.169","journal-title":"Procedia Computer Science"},{"key":"1833_CR38","doi-asserted-by":"publisher","unstructured":"Matias JB, Fajardo AC, Medina RM (2018) Examining genetic algorithm with guided search and self-adaptive neighborhood strategies for curriculum-based course timetable problem. In: IEEE fourth international conference on advances in computing, communication & automation, pp 1\u20136. https:\/\/doi.org\/10.1109\/ICACCAF.2018.8776728","DOI":"10.1109\/ICACCAF.2018.8776728"},{"key":"1833_CR39","doi-asserted-by":"publisher","unstructured":"Gozali AA, Fujimura S (2020) Solving University course timetabling problem using multi-depth genetic algorithm-solving UCTP using MDGA. In: SHS web of conferences. EDP Sciences, pp 1\u201318. https:\/\/doi.org\/10.1051\/shsconf\/20207701001","DOI":"10.1051\/shsconf\/20207701001"},{"issue":"2","key":"1833_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14488\/BJOPM.2020.014","volume":"17","author":"DS Vianna","year":"2020","unstructured":"Vianna DS, Martins CB, Lima TJ, Vianna MDFD, Meza EBM (2020) Hybrid VNS-TS heuristics for university course timetabling problem. Brazilian Journal of Operations & Production Management 17(2):1\u201320. https:\/\/doi.org\/10.14488\/BJOPM.2020.014","journal-title":"Brazilian Journal of Operations & Production Management"},{"issue":"2","key":"1833_CR41","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.ejor.2019.11.024","volume":"283","author":"A G\u00fclc\u00fc","year":"2020","unstructured":"G\u00fclc\u00fc A, Akkan C (2020) Robust university course timetabling problem subject to single and multiple disruptions. Eur J Oper Res 283(2):630\u2013646. https:\/\/doi.org\/10.1016\/j.ejor.2019.11.024","journal-title":"Eur J Oper Res"},{"key":"1833_CR42","doi-asserted-by":"publisher","unstructured":"Susan S, Bhutani A (2019) A novel memetic algorithm incorporating greedy stochastic local search mutation for Course scheduling. In: 2019 IEEE international conference on computational science and engineering, pp 254\u2013259. https:\/\/doi.org\/10.1109\/CSE\/EUC.2019.00056","DOI":"10.1109\/CSE\/EUC.2019.00056"},{"key":"1833_CR43","doi-asserted-by":"publisher","unstructured":"Habashi SS, Salama C, Yousef AH, Fahmy HM (2018) Adaptive diversifying hyper-Heuristic based approach for timetabling problems. In: 2018 IEEE 9th annual information technology, electronics and mobile communication conference, pp 259\u2013266. https:\/\/doi.org\/10.1109\/IEMCON.2018.8615035","DOI":"10.1109\/IEMCON.2018.8615035"},{"key":"1833_CR44","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cie.2014.11.010","volume":"86","author":"H Babaei","year":"2015","unstructured":"Babaei H, Karimpour J, Hadidi A (2015) A survey of approaches for university course timetabling problem. Comput Ind Eng 86:43\u201359. https:\/\/doi.org\/10.1016\/j.cie.2014.11.010","journal-title":"Comput Ind Eng"},{"issue":"15","key":"1833_CR45","doi-asserted-by":"publisher","first-page":"8121","DOI":"10.1016\/j.amc.2013.02.017","volume":"219","author":"P Civicioglu","year":"2013","unstructured":"Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121\u20138144. https:\/\/doi.org\/10.1016\/j.amc.2013.02.017","journal-title":"Appl Math Comput"},{"issue":"4","key":"1833_CR46","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1155\/S1023621X04000314","volume":"10","author":"H Saruhan","year":"2004","unstructured":"Saruhan H, Rouch KE, Roso CA (2004) Design optimization of tilting-pad journal bearing using a genetic algorithm. International Journal of Rotating Machinery 10(4):301\u2013307. https:\/\/doi.org\/10.1155\/S1023621X04000314","journal-title":"International Journal of Rotating Machinery"},{"key":"1833_CR47","doi-asserted-by":"publisher","unstructured":"Karami AH, Hasanzadeh M (2012) University course timetabling using a new hybrid genetic algorithm. Computer and Knowledge Engineering, IEEE, pp 144\u2013149. https:\/\/doi.org\/10.1109\/ICCKE.2012.6395368","DOI":"10.1109\/ICCKE.2012.6395368"},{"key":"1833_CR48","unstructured":"Jat SN, Yang S (2009) A guided search genetic algorithm for the university course timetabling problem. In: The 4th multidisciplinary international scheduling conference: theory and applications, pp 180\u2013191. http:\/\/bura.brunel.ac.uk\/handle\/2438\/5880"},{"key":"1833_CR49","doi-asserted-by":"publisher","unstructured":"Shaker K, Abdullah S, Hatem A (2012) A differential evolution algorithm for the university course timetabling problem. In: 2012 IEEE 4th conference on data mining and optimization, pp 99\u2013102. https:\/\/doi.org\/10.1109\/DMO.2012.6329805","DOI":"10.1109\/DMO.2012.6329805"},{"key":"1833_CR50","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cie.2016.12.019","volume":"104","author":"A Azadeh","year":"2017","unstructured":"Azadeh A, Elahi S, Farahani MH, Nasirian B (2017) A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment. Comput Ind Eng 104:124\u2013133. https:\/\/doi.org\/10.1016\/j.cie.2016.12.019","journal-title":"Comput Ind Eng"},{"issue":"7","key":"1833_CR51","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1016\/j.dam.2008.10.014","volume":"157","author":"J Studenovsk\u00fd","year":"2009","unstructured":"Studenovsk\u00fd J (2009) Polynomial reduction of time\u2013space scheduling to time scheduling. Discret Appl Math 157(7):1364\u20131378. https:\/\/doi.org\/10.1016\/j.dam.2008.10.014","journal-title":"Discret Appl Math"},{"issue":"10","key":"1833_CR52","doi-asserted-by":"publisher","first-page":"12349","DOI":"10.1016\/j.eswa.2009.04.051","volume":"36","author":"CH Aladag","year":"2009","unstructured":"Aladag CH, Hocaoglu G, Basaran MA (2009) The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem. Expert Syst Appl 36(10):12349\u201312356. https:\/\/doi.org\/10.1016\/j.eswa.2009.04.051","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1833_CR53","doi-asserted-by":"publisher","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 graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176(1):177\u2013192. https:\/\/doi.org\/10.1016\/j.ejor.2005.08.012","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1833_CR54","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.autcon.2008.04.002","volume":"18","author":"M Rogalska","year":"2008","unstructured":"Rogalska M, Bo\u017cejko W, Hejducki Z (2008) Time\/cost optimization using hybrid evolutionary algorithm in construction project scheduling. Autom Constr 18(1):24\u201331. https:\/\/doi.org\/10.1016\/j.autcon.2008.04.002","journal-title":"Autom Constr"},{"key":"1833_CR55","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.ins.2014.10.004","volume":"295","author":"S Kifah","year":"2015","unstructured":"Kifah S, Abdullah S (2015) An adaptive non-linear great deluge algorithm for the patient-admission problem. Inf Sci 295:573\u2013585. https:\/\/doi.org\/10.1016\/j.ins.2014.10.004","journal-title":"Inf Sci"},{"issue":"2","key":"1833_CR56","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1108\/IJICC-02-2015-0005","volume":"8","author":"Y Lei","year":"2015","unstructured":"Lei Y, Gong M, Jiao L, Zuo Y (2015) A memetic algorithm based on hyper-heuristics for examination timetabling problems. International Journal of Intelligent Computing and Cybernetics 8(2):139\u2013151. https:\/\/doi.org\/10.1108\/IJICC-02-2015-0005","journal-title":"International Journal of Intelligent Computing and Cybernetics"},{"issue":"13","key":"1833_CR57","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.asoc.2015.11.043","volume":"40","author":"JA Soria-Alcaraz","year":"2016","unstructured":"Soria-Alcaraz JA, \u00d6zcan E, Swan J, Kendall G, Carpio M (2016) Iterated local search using an add and delete hyper-heuristic for university course timetabling. Appl Soft Comput 40(13):581\u2013593. https:\/\/doi.org\/10.1016\/j.asoc.2015.11.043","journal-title":"Appl Soft Comput"},{"issue":"4","key":"1833_CR58","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1016\/j.cor.2006.08.010","volume":"35","author":"GN Beligiannis","year":"2008","unstructured":"Beligiannis GN, Moschopoulos CN, Kaperonis GP, Likothanassis SD (2008) Applying evolutionary computation to the school timetabling problem: the Greek case. Comput Oper Res 35(4):1265\u20131280. https:\/\/doi.org\/10.1016\/j.cor.2006.08.010","journal-title":"Comput Oper Res"},{"issue":"1","key":"1833_CR59","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10479-012-1078-5","volume":"194","author":"C Nothegger","year":"2012","unstructured":"Nothegger C, Mayer A, Chwatal A, Raidl GR (2012) Solving the post enrolment course timetabling problem by ant colony optimization. Ann Oper Res 194(1):325\u2013339. https:\/\/doi.org\/10.1007\/s10479-012-1078-5","journal-title":"Ann Oper Res"},{"issue":"1","key":"1833_CR60","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s40815-015-0046-z","volume":"18","author":"F Cavdur","year":"2016","unstructured":"Cavdur F, Kose M (2016) A fuzzy logic and binary-goal programming-based approach for solving the exam timetabling problem to create a balanced-exam schedule. International Journal of Fuzzy Systems 18(1):119\u2013129. https:\/\/doi.org\/10.1007\/s40815-015-0046-z","journal-title":"International Journal of Fuzzy Systems"},{"issue":"2","key":"1833_CR61","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2):204\u2013223. https:\/\/doi.org\/10.1109\/TEVC.2003.810752","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1833_CR62","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556788.2016.1233970","volume":"32","author":"X Feng","year":"2017","unstructured":"Feng X, Lee Y, Moon I (2017) An integer program and a hybrid genetic algorithm for the university timetabling problem. Optimization Methods and Software 32(3):625\u2013649. https:\/\/doi.org\/10.1080\/10556788.2016.1233970","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"1833_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-010-9154-y","volume":"18","author":"S Abdullah","year":"2012","unstructured":"Abdullah S, Turabieh H, McCollum B, McMullan P (2012) A hybrid metaheuristic approach to the university course timetabling problem. J Heuristics 18(1):1\u201323. https:\/\/doi.org\/10.1007\/s10732-010-9154-y","journal-title":"J Heuristics"},{"issue":"3","key":"1833_CR64","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.ejor.2006.12.064","volume":"191","author":"N Mladenovi\u0107","year":"2008","unstructured":"Mladenovi\u0107 N, Dra\u017ei\u0107 M, Kova\u010devic-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M (2008) General variable neighborhood search for the continuous optimization. Eur J Oper Res 191(3):753\u2013770. https:\/\/doi.org\/10.1016\/j.ejor.2006.12.064","journal-title":"Eur J Oper Res"},{"issue":"6","key":"1833_CR65","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1023\/B:HEUR.0000012446.94732.b6","journal-title":"J Heuristics"},{"issue":"4","key":"1833_CR66","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1016\/j.cor.2007.12.007","volume":"36","author":"H Asmuni","year":"2009","unstructured":"Asmuni H, Burke EK, Garibaldi JM, McCollum B, Parkes AJ (2009) An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables. Comput Oper Res 36(4):981\u20131001. https:\/\/doi.org\/10.1016\/j.cor.2007.12.007","journal-title":"Comput Oper Res"},{"key":"1833_CR67","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cie.2014.09.020","volume":"78","author":"RP Badoni","year":"2014","unstructured":"Badoni RP, Gupta DK, Mishra P (2014) A new hybrid algorithm for university course timetabling problem using events based on groupings of students. Comput Ind Eng 78:12\u201325. https:\/\/doi.org\/10.1016\/j.cie.2014.09.020","journal-title":"Comput Ind Eng"},{"issue":"6","key":"1833_CR68","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10951-010-0202-0","volume":"14","author":"SN Jat","year":"2011","unstructured":"Jat SN, Yang S (2011) A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling. J Sched 14(6):617\u2013637. https:\/\/doi.org\/10.1007\/s10951-010-0202-0","journal-title":"J Sched"},{"issue":"1","key":"1833_CR69","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-010-0737-7","volume":"194","author":"H Cambazard","year":"2012","unstructured":"Cambazard H, Hebrard E, O\u2019Sullivan B, Papadopoulos A (2012) Local search and constraint programming for the post enrolment-based course timetabling problem. Ann Oper Res 194(1):111\u2013135. https:\/\/doi.org\/10.1007\/s10479-010-0737-7","journal-title":"Ann Oper Res"},{"issue":"1","key":"1833_CR70","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10479-010-0696-z","volume":"194","author":"R Lewis","year":"2012","unstructured":"Lewis R (2012) A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Ann Oper Res 194(1):273\u2013289. https:\/\/doi.org\/10.1007\/s10479-010-0696-z","journal-title":"Ann Oper Res"},{"issue":"7","key":"1833_CR71","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.cor.2011.09.014","volume":"39","author":"S Ceschia","year":"2012","unstructured":"Ceschia S, Di Gaspero L, Schaerf A (2012) Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Comput Oper Res 39(7):1615\u20131624. https:\/\/doi.org\/10.1016\/j.cor.2011.09.014","journal-title":"Comput Oper Res"},{"issue":"1","key":"1833_CR72","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2014.03.046","volume":"238","author":"JA Soria-Alcaraz","year":"2014","unstructured":"Soria-Alcaraz JA, Ochoa G, Swan J, Carpio M, Puga H, Burke EK (2014) Effective learning hyper-heuristics for the course timetabling problem. Eur J Oper Res 238(1):77\u201386. https:\/\/doi.org\/10.1016\/j.ejor.2014.03.046","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1833_CR73","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc Z, Hao JK (2010) Adaptive tabu search for course timetabling. Eur J Oper Res 200(1):235\u2013244. https:\/\/doi.org\/10.1016\/j.ejor.2008.12.007","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1833_CR74","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-018-2757-7","volume":"275","author":"M Banbara","year":"2019","unstructured":"Banbara M, Inoue K, Kaufmann B, Okimoto T, Schaub T, Soh T, Wanko P (2019) teaspoon: solving the curriculum-based course timetabling problems with answer set programming. Ann Oper Res 275(1):3\u201337. https:\/\/doi.org\/10.1007\/s10479-018-2757-7","journal-title":"Ann Oper Res"},{"key":"1833_CR75","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cor.2017.09.014","volume":"90","author":"Y Nagata","year":"2018","unstructured":"Nagata Y (2018) Random partial neighborhood search for the post-enrollment course timetabling problem. Comput Oper Res 90:84\u201396. https:\/\/doi.org\/10.1016\/j.cor.2017.09.014","journal-title":"Comput Oper Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01833-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01833-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01833-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T03:36:11Z","timestamp":1723433771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01833-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,19]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["1833"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01833-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,19]]},"assertion":[{"value":"19 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}