{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T23:56:34Z","timestamp":1773964594878,"version":"3.50.1"},"reference-count":102,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T00:00:00Z","timestamp":1597276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T00:00:00Z","timestamp":1597276800000},"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":["Evol. Intel."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s12065-020-00438-0","type":"journal-article","created":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T12:02:36Z","timestamp":1597320156000},"page":"1869-1893","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Novel operators for quantum evolutionary algorithm in solving timetabling problem"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5999-2134","authenticated-orcid":false,"given":"Mohammad-H.","family":"Tayarani-N.","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,13]]},"reference":[{"key":"438_CR1","unstructured":"Or-library. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/tableinfo.html. Accessed 30 Sep 2010"},{"key":"438_CR2","doi-asserted-by":"crossref","unstructured":"A lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Applied Mathematics 154(5):738\u2013753 (2006). IV ALIO\/EURO Workshop on Applied Combinatorial Optimization","DOI":"10.1016\/j.dam.2005.05.026"},{"key":"438_CR3","first-page":"153","volume-title":"Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem","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. Springer, Boston, pp 153\u2013169"},{"key":"438_CR4","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","journal-title":"Comput Oper Res"},{"key":"438_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.02.011","volume":"61","author":"SM Al-Yakoob","year":"2015","unstructured":"Al-Yakoob SM, Sherali HD (2015) Mathematical models and algorithms for a high school timetabling problem. Comput Oper Res 61:56\u201368","journal-title":"Comput Oper Res"},{"issue":"2","key":"438_CR6","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TEVC.2005.843751","volume":"9","author":"E Alba","year":"2005","unstructured":"Alba E, Dorronsoro B (2005) The exploration\/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE Trans Evol Comput 9(2):126\u2013142","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"438_CR7","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/TEVC.2002.800880","volume":"6","author":"E Alba","year":"2002","unstructured":"Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms. IEEE Trans Evol Comput 6(5):443\u2013462","journal-title":"IEEE Trans Evol Comput"},{"key":"438_CR8","unstructured":"Arabas J, Michalewicz Z, Mulawka J (1994) Gavaps-a genetic algorithm with varying population size. In: Proceedings of the 1st IEEE conference on evolutionary computation, 1994. IEEE world congress on computational intelligence. vol 1, pp 73\u201378"},{"issue":"2","key":"438_CR9","first-page":"705","volume":"163","author":"ZN Azimi","year":"2005","unstructured":"Azimi ZN (2005) Hybrid heuristics for examination timetabling problem. Appl Math Comput 163(2):705\u2013733","journal-title":"Appl Math Comput"},{"key":"438_CR10","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","journal-title":"Comput Ind Eng"},{"issue":"7","key":"438_CR11","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1080\/01605682.2018.1495870","volume":"70","author":"M Battistutta","year":"2019","unstructured":"Battistutta M, Ceschia S, Cesco FD, Gaspero LD, Schaerf A (2019) Modelling and solving the thesis defense timetabling problem. J Oper Res Soc 70(7):1039\u20131050","journal-title":"J Oper Res Soc"},{"issue":"4","key":"438_CR12","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","journal-title":"Comput Oper Res"},{"issue":"5","key":"438_CR13","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TEVC.2005.863128","volume":"10","author":"KM Bryden","year":"2006","unstructured":"Bryden KM, Ashlock DA, Corns S, Willson SJ (2006) Graph-based evolutionary algorithms. IEEE Trans Evol Comput 10(5):550\u2013567","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"438_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"EK Burke","year":"2004","unstructured":"Burke EK, De Causmaecker P, Berghe GV, Van Landeghem H (2004) The state of the art of nurse rostering. J Schedul 7(6):441\u2013499. https:\/\/doi.org\/10.1023\/B:JOSH.0000046076.75950.0b","journal-title":"J Schedul"},{"issue":"2","key":"438_CR15","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"EK Burke","year":"2002","unstructured":"Burke EK, Petrovic S (2002) Recent research directions in automated timetabling. Eur J Oper Res 140(2):266\u2013280","journal-title":"Eur J Oper Res"},{"key":"438_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.omega.2015.04.006","volume":"58","author":"V Cacchiani","year":"2016","unstructured":"Cacchiani V, Furini F, Kidd MP (2016) Approaches to a real-world train timetabling problem in a railway node. Omega 58:97\u2013110","journal-title":"Omega"},{"key":"438_CR17","volume-title":"Efficient and accurate parallel genetic algorithms","author":"E Cant\u00fa-Paz","year":"2000","unstructured":"Cant\u00fa-Paz E (2000) Efficient and accurate parallel genetic algorithms, 1st edn. Kluwer, Dordrecht","edition":"1"},{"issue":"1","key":"438_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ejor.2008.01.043","volume":"195","author":"PD Causmaecker","year":"2009","unstructured":"Causmaecker PD, Demeester P, Berghe GV (2009) A decomposed metaheuristic approach for a real-world university timetabling problem. Eur J Oper Res 195(1):307\u2013318","journal-title":"Eur J Oper Res"},{"key":"438_CR19","unstructured":"Ceschia S, Schaerf A (2018) Solving the inrc-ii nurse rostering problem by simulated annealing based on large neighborhoods. PATAT"},{"key":"438_CR20","unstructured":"Ceschia S, Thanh NDT, Causmaecker PD, Haspeslagh S, Schaerf A (2015) Second international nurse rostering competition (INRC-II) - problem description and rules-. CoRR arXiv:1501.04177"},{"issue":"3","key":"438_CR21","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1016\/j.eswa.2009.07.066","volume":"37","author":"PC Chang","year":"2010","unstructured":"Chang PC, Huang WH, Ting CJ (2010) Dynamic diversity control in genetic algorithm for mining unsearched solution space in tsp problems. Expert Syst Appl 37(3):1863\u20131878","journal-title":"Expert Syst Appl"},{"issue":"3","key":"438_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-2217(03)00021-3","volume":"151","author":"B Cheang","year":"2003","unstructured":"Cheang B, Li H, Lim A, Rodrigues B (2003) Nurse rostering problems\u2014a bibliographic survey. Eur J Oper Res 151(3):447\u2013460. https:\/\/doi.org\/10.1016\/S0377-2217(03)00021-3","journal-title":"Eur J Oper Res"},{"key":"438_CR23","unstructured":"Dang NTT, Ceschia S, Schaerf A, De\u00a0Causmaecker P, Haspeslagh S (2016) Solving the multi-stage nurse rostering problem. In: Proceedings of the 11th international conference of the practice and theory of automated timetabling, pp 473\u2013475"},{"issue":"3","key":"438_CR24","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1016\/j.ejor.2008.03.036","volume":"197","author":"B Detienne","year":"2009","unstructured":"Detienne B, P\u00e9ridy L, Pinson \u00c9ric, Rivreau D (2009) Cut generation for an employee timetabling problem. Eur J Oper Res 197(3):1178\u20131184","journal-title":"Eur J Oper Res"},{"key":"438_CR25","unstructured":"Dick G (2003) The spatially-dispersed genetic algorithm: an explicit spatial population structure for gas. In: The 2003 congress on evolutionary computation, 2003, CEC \u201903. vol 4, pp 2455\u20132461"},{"issue":"1","key":"438_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1142\/S012906571000222X","volume":"20","author":"HB Duan","year":"2010","unstructured":"Duan HB (2010) A hybrid artificial bee colony optimization and quantum evolutionary algorithm for continuous optimization problems. Int J Neural Syst 20(1):39\u201350","journal-title":"Int J Neural Syst"},{"key":"438_CR27","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-77345-0_23","volume-title":"Practice and theory of automated timetabling VI","author":"M Eley","year":"2007","unstructured":"Eley M (2007) Ant algorithms for the exam timetabling problem. In: Burke EK, Rudova H (eds) Practice and theory of automated timetabling VI. Springer, Berlin, pp 364\u2013382"},{"issue":"2","key":"438_CR28","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2015.12.006","volume":"251","author":"P Fouilhoux","year":"2016","unstructured":"Fouilhoux P, Ibarra-Rojas O, Kedad-Sidhoum S, Rios-Solis Y (2016) Valid inequalities for the synchronization bus timetabling problem. Eur J Oper Res 251(2):442\u2013450","journal-title":"Eur J Oper Res"},{"issue":"1","key":"438_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2017.01.040","volume":"261","author":"SL Goh","year":"2017","unstructured":"Goh SL, Kendall G, Sabar NR (2017) Improved local search approaches to solve the post enrolment course timetabling problem. Eur J Oper Res 261(1):17\u201329","journal-title":"Eur J Oper Res"},{"issue":"5","key":"438_CR30","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.cor.2009.07.002","volume":"37","author":"J Gu","year":"2010","unstructured":"Gu J, Gu M, Cao C, Gu X (2010) A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem. Comput Oper Res 37(5):927\u2013937","journal-title":"Comput Oper Res"},{"key":"438_CR31","doi-asserted-by":"crossref","unstructured":"Han CW, Park JI (2006) Population structure of heuristic search algorithm based on adaptive partitioning. In: Advances in applied artificial intelligence, vol 4031. Lecture notes in computer science. Springer, Berlin, pp 238\u2013243","DOI":"10.1007\/11779568_27"},{"issue":"2","key":"438_CR32","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/TEVC.2004.823467","volume":"8","author":"H Han","year":"2004","unstructured":"Han H, Kim H (2004) Quantum-inspired evolutionary algorithms with a new termination criterion, $$\\text{ h }_\\epsilon $$ gate, and two-phase scheme. IEEE Trans Evol Comput 8(2):156\u2013169","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"438_CR33","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"KH Han","year":"2002","unstructured":"Han KH, Kim JH (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans Evol Comput 6(6):580\u2013593","journal-title":"IEEE Trans Evol Comput"},{"key":"438_CR34","unstructured":"Han KH, Kim JH (2003) On setting the parameters of quantum-inspired evolutionary algorithm for practical application. In: The 2003 congress on evolutionary computation, 2003, CEC \u201903. vol 1, pp 178\u2013194"},{"key":"438_CR35","unstructured":"Han KH, Park KH, Lee CH, Kim JH (2001) Parallel quantum-inspired genetic algorithm for combinatorial optimization problem. In: Proceedings of the 2001 congress on evolutionary computation, vol 2, pp 1422\u20131429"},{"key":"438_CR36","doi-asserted-by":"crossref","unstructured":"Haupt R (2000) Optimum population size and mutation rate for a simple real genetic algorithm that optimizes array factors. In: Antennas and propagation society international symposium, 2000, vol 2. IEEE, pp 1034\u20131037","DOI":"10.1109\/APS.2000.875398"},{"key":"438_CR37","doi-asserted-by":"crossref","unstructured":"Hong Y, Ren Q, Zeng J (2005) Adaptive population size for univariate marginal distribution algorithm. In: The 2005 IEEE congress on evolutionary computation, 2005, vol 2, pp 1396\u20131402","DOI":"10.1145\/1068009.1068133"},{"key":"438_CR38","doi-asserted-by":"crossref","unstructured":"Jang JS, Han KH, Kim JH (2003) Quantum-inspired evolutionary algorithm-based face verification. In: Proceedings of the 2003 international conference on genetic and evolutionary computation: Part II, GECCO\u201903, Springer, Berlin, pp 2147\u20132156. http:\/\/dl.acm.org\/citation.cfm?id=1756582.1756699","DOI":"10.1007\/3-540-45110-2_110"},{"key":"438_CR39","doi-asserted-by":"crossref","unstructured":"Jang JS, Han KH, Kim JH (2003) Quantum-inspired evolutionary algorithm-based face verification. In: Genetic and evolutionary computation 2003, vol 2724. Lecture Notes in Computer Science. Springer, Berlin, pp 214\u2013214","DOI":"10.1007\/3-540-45110-2_110"},{"key":"438_CR40","unstructured":"Jang JS, Han KH, Kim JH (2004) Face detection using quantum-inspired evolutionary algorithm. In: Congress on evolutionary computation, 2004. CEC 2004. vol 2, pp 2100\u20132106"},{"key":"438_CR41","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1108\/02644400710734990","volume":"24","author":"A Kaveh","year":"2006","unstructured":"Kaveh A, Shahrouzi M (2006) A hybrid ant strategy and genetic algorithm to tune the population size for efficient structural optimization. Emerald J Eng Comput 24:237\u2013254","journal-title":"Emerald J Eng Comput"},{"key":"438_CR42","unstructured":"Kennedy J, Mendes R (2002) Population structure and particle swarm performance. In: Proceedings of the 2002 congress on evolutionary computation, 2002. CEC \u201902. vol 2, pp 1671\u20131676"},{"key":"438_CR43","unstructured":"Khor E, Tan K, Wang M, Lee T (2000) Evolutionary algorithm with dynamic population size for multi-objective optimization. In: 26th Annual conference of the IEEE industrial electronics society, 2000. IECON 2000. vol 4, pp 2768\u20132773"},{"issue":"1","key":"438_CR44","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TEVC.2005.860765","volume":"10","author":"V Koumousis","year":"2006","unstructured":"Koumousis V, Katsaras C (2006) A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance. IEEE Trans Evol Comput 10(1):19\u201328","journal-title":"IEEE Trans Evol Comput"},{"key":"438_CR45","unstructured":"Koumousis VK, Katsaras CP (2002) The effect of oscillating population size and re-initialization on the performance of genetic algorithms. In: Proceedings of the third international conference on engineering computational technology, ICECT\u201903, Civil-Comp press, Edinburgh, UK, pp 185\u2013186"},{"key":"438_CR46","first-page":"1","volume":"1","author":"A Legrain","year":"2017","unstructured":"Legrain A, Omer J, Rosat S (2017) A rotation-based branch-and-price approach for the nurse scheduling problem. Math Program Comput 1:1\u201334","journal-title":"Math Program Comput"},{"key":"438_CR47","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.eswa.2018.12.048","volume":"122","author":"N Leite","year":"2019","unstructured":"Leite N, Mel\u00edcio F, Rosa AC (2019) A fast simulated annealing algorithm for the examination timetabling problem. Expert Syst Appl 122:137\u2013151","journal-title":"Expert Syst Appl"},{"key":"438_CR48","doi-asserted-by":"publisher","DOI":"10.1201\/9780203489802","volume-title":"Bus and train driver scheduling, handbook of scheduling: algorithms, models, and performance analysis, Chapter 51","author":"JY Leung","year":"2004","unstructured":"Leung JY (2004) Bus and train driver scheduling, handbook of scheduling: algorithms, models, and performance analysis, Chapter 51. CRC Press, Boca Raton"},{"key":"438_CR49","doi-asserted-by":"publisher","DOI":"10.1201\/9780203489802","volume-title":"Sports scheduling, handbook of scheduling: algorithms, models, and performance analysis, Chapter 52","author":"JY Leung","year":"2004","unstructured":"Leung JY (2004) Sports scheduling, handbook of scheduling: algorithms, models, and performance analysis, Chapter 52. CRC Press, Boca Raton"},{"key":"438_CR50","doi-asserted-by":"publisher","DOI":"10.1201\/9780203489802","volume-title":"University timetabling, handbook of scheduling: algorithms, models, and performance analysis, Chapter 45","author":"JY Leung","year":"2004","unstructured":"Leung JY (2004) University timetabling, handbook of scheduling: algorithms, models, and performance analysis, Chapter 45. CRC Press, Boca Raton"},{"issue":"3","key":"438_CR51","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ejor.2014.07.041","volume":"240","author":"R Lewis","year":"2015","unstructured":"Lewis R, Thompson J (2015) Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. Eur J Oper Res 240(3):637\u2013648","journal-title":"Eur J Oper Res"},{"key":"438_CR52","unstructured":"Li D, Wang L (2002) A study on the optimal population size of genetic algorithm. In: Proceedings of the 4th World Congress on Intelligent Control and Automation 2002, vol 4, pp 3019\u20133021"},{"key":"438_CR53","first-page":"3301","volume":"4","author":"Y Li","year":"2004","unstructured":"Li Y, Zhang Y, Zhao R, Jiao L (2004) The immune quantum-inspired evolutionary algorithm. IEEE Int Conf Syst Man Cybern 4:3301\u20133305","journal-title":"IEEE Int Conf Syst Man Cybern"},{"key":"438_CR54","doi-asserted-by":"crossref","unstructured":"Li Z, Xu B, Yang L, Chen J, Li K (2009) Quantum evolutionary algorithm for multi-robot coalition formation. In: Proceedings of the 1st ACM\/SIGEVO summit on genetic and evolutionary computation. ACM, New York, pp 295\u2013302","DOI":"10.1145\/1543834.1543874"},{"issue":"3","key":"438_CR55","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S1476-9271(02)00083-X","volume":"27","author":"Q Lu","year":"2003","unstructured":"Lu Q, Shen G, Yu R (2003) A chaotic approach to maintain the population diversity of genetic algorithm in network training. Comput Biol Chem 27(3):363\u2013371","journal-title":"Comput Biol Chem"},{"key":"438_CR56","doi-asserted-by":"crossref","unstructured":"Mallipeddi R, Suganthan P (2008) Empirical study on the effect of population size on differential evolution algorithm. In: IEEE Congress on Evolutionary Computation, 2008, CEC 2008 (IEEE World Congress on Computational Intelligence), pp 3663 \u20133670","DOI":"10.1109\/CEC.2008.4631294"},{"key":"438_CR57","doi-asserted-by":"crossref","unstructured":"Mischek F, Musliu N (2016) Integer programming and heuristic approaches for a multi-stage nurse rostering problem. In: PATAT 2016: Proceedings of the 11th international conference of the practice and theory of automated timetabling, PATAT","DOI":"10.1007\/s10479-017-2623-z"},{"key":"438_CR58","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-89619-7_38","volume-title":"Applications of soft computing","author":"T Mohammad","year":"2009","unstructured":"Mohammad T, Reza ATM (2009) Improvement of quantum evolutionary algorithm with a functional sized population. In: Mehnen J, Koppen M, Saad A, Tiwari A (eds) Applications of soft computing. Springer, Berlin, Heidelberg, pp 389\u2013398"},{"key":"438_CR59","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"},{"issue":"3","key":"438_CR60","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.ejor.2016.07.002","volume":"256","author":"PD \u00c1rton","year":"2017","unstructured":"\u00c1rton PD, de Ara\u00fajo OC, Buriol LS (2017) A column generation approach to high school timetabling modeled as a multicommodity flow problem. Eur J Oper Res 256(3):685\u2013695","journal-title":"Eur J Oper Res"},{"key":"438_CR61","first-page":"426","volume-title":"Pattern recognition. Lecture notes in computer science","author":"S Park","year":"2003","unstructured":"Park S, Kim E, Cho BJ (2003) Genetic algorithm-based video segmentation with adaptive population size. In: Michaelis B, Krell G (eds) Pattern recognition. Lecture notes in computer science, vol 2781. Springer, Berlin, pp 426\u2013433"},{"issue":"2","key":"438_CR62","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2008.07.023","volume":"197","author":"N Pillay","year":"2009","unstructured":"Pillay N, Banzhaf W (2009) A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem. Eur J Oper Res 197(2):482\u2013491. https:\/\/doi.org\/10.1016\/j.ejor.2008.07.023","journal-title":"Eur J Oper Res"},{"issue":"1","key":"438_CR63","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10479-017-2625-x","volume":"275","author":"N Pillay","year":"2019","unstructured":"Pillay N, \u00d6zcan E (2019) Automated generation of constructive ordering heuristics for educational timetabling. Ann Oper Res 275(1):181\u2013208","journal-title":"Ann Oper Res"},{"issue":"1","key":"438_CR64","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10479-011-1012-2","volume":"218","author":"G Post","year":"2014","unstructured":"Post G, Kingston JH, Ahmadi S, Daskalaki S, Gogos C, Kyngas J, Nurmi C, Musliu N, Pillay N, Santos H, Schaerf A (2014) Xhstt: an xml archive for high school timetabling problems in different countries. Ann Oper Res 218(1):295\u2013301","journal-title":"Ann Oper Res"},{"issue":"3","key":"438_CR65","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1109\/TEVC.2011.2163638","volume":"16","author":"A Pr\u00fcgel-Bennett","year":"2011","unstructured":"Pr\u00fcgel-Bennett A, Tayarani-N MH (2011) Maximum satisfiability: anatomy of the fitness landscape for a hard combinatorial optimisation problem. IEEE Trans Evol Comput 16(3):319\u2013338","journal-title":"IEEE Trans Evol Comput"},{"key":"438_CR66","doi-asserted-by":"crossref","unstructured":"Qin C, Zheng J, Lai J (2007) A multiagent quantum evolutionary algorithm for global numerical optimization. In: Life system modeling and simulation, vol 4689. Lecture notes in computer science. Springer, Berlin\/Heidelberg, pp 380\u2013389","DOI":"10.1007\/978-3-540-74771-0_43"},{"issue":"1","key":"438_CR67","doi-asserted-by":"publisher","first-page":"39","DOI":"10.5784\/31-1-158","volume":"31","author":"R Raghavjee","year":"2015","unstructured":"Raghavjee R, Pillay N (2015) A genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem. ORiON 31(1):39\u201360","journal-title":"ORiON"},{"issue":"1","key":"438_CR68","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.pnucene.2010.08.004","volume":"53","author":"A dos Santos Nicolau","year":"2011","unstructured":"dos Santos Nicolau A, Schirru R, de Moura Meneses AA (2011) Quantum evolutionary algorithm applied to transient identification of a nuclear power plant. Prog Nucl Energy 53(1):86\u201391","journal-title":"Prog Nucl Energy"},{"key":"438_CR69","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.asoc.2017.06.047","volume":"60","author":"L Saviniec","year":"2017","unstructured":"Saviniec L, Constantino AA (2017) Effective local search algorithms for high school timetabling problems. Appl Soft Comput 60:363\u2013373","journal-title":"Appl Soft Comput"},{"issue":"1","key":"438_CR70","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","journal-title":"Eur J Oper Res"},{"issue":"2","key":"438_CR71","doi-asserted-by":"publisher","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"},{"key":"438_CR72","doi-asserted-by":"crossref","unstructured":"Sekaj I, Oravec M (2009) Selected population characteristics of fine-grained parallel genetic algorithms with re-initialization. In: Proceedings of the 1st ACM\/SIGEVO summit on genetic and evolutionary computation, GEC \u201909. ACM, pp 945\u2013948","DOI":"10.1145\/1543834.1543980"},{"key":"438_CR73","doi-asserted-by":"crossref","unstructured":"Sekaj I, Perkacz J (2007) Some aspects of parallel genetic algorithms with population re-initialization. In: IEEE Congress on evolutionary computation, 2007, CEC 2007. pp 1333\u20131338","DOI":"10.1109\/CEC.2007.4424625"},{"key":"438_CR74","doi-asserted-by":"publisher","DOI":"10.1201\/9781420036268","volume-title":"Handbook of parametric and nonparametric statistical procedures","author":"DJ Sheskin","year":"2003","unstructured":"Sheskin DJ (2003) Handbook of parametric and nonparametric statistical procedures. CRC Press, Boca Raton"},{"key":"438_CR75","doi-asserted-by":"crossref","unstructured":"Shi X, Wan L, Lee H, Yang X, Wang L, Liang Y (2003) An improved genetic algorithm with variable population-size and a pso-ga based hybrid evolutionary algorithm. In: International conference on machine learning and cybernetics, 2003, vol 3, pp 1735\u20131740","DOI":"10.1109\/ICMLC.2003.1259777"},{"key":"438_CR76","doi-asserted-by":"crossref","unstructured":"Shimodaira H (1997) Dcga: a diversity control oriented genetic algorithm. In: Proceedings of the 9th IEEE international conference on tools with artificial intelligence, 1997, pp 367 \u2013374","DOI":"10.1049\/cp:19971221"},{"issue":"12","key":"438_CR77","first-page":"1745","volume":"E84\u2013D","author":"H Shimodaira","year":"2001","unstructured":"Shimodaira H (2001) Methods for reinitializing the population to improve the performance of a diversity-control-oriented genetic algorithm. IEICE Trans Inf Syst E84\u2013D(12):1745\u20131755","journal-title":"IEICE Trans Inf Syst"},{"key":"438_CR78","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.asoc.2016.10.038","volume":"52","author":"VI Skoullis","year":"2017","unstructured":"Skoullis VI, Tassopoulos IX, Beligiannis GN (2017) Solving the high school timetabling problem using a hybrid cat swarm optimization based algorithm. Appl Soft Comput 52:277\u2013289","journal-title":"Appl Soft Comput"},{"key":"438_CR79","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.asoc.2018.04.034","volume":"68","author":"T Song","year":"2018","unstructured":"Song T, Liu S, Tang X, Peng X, Chen M (2018) An iterated local search algorithm for the university course timetabling problem. Appl Soft Comput 68:597\u2013608","journal-title":"Appl Soft Comput"},{"key":"438_CR80","doi-asserted-by":"crossref","unstructured":"Tayarani N MH, Akbarzadeh T MR (2008) A cellular structure and diversity preserving operator in quantum evolutionary algorithms. In: 2008 IEEE congress on evolutionary computation (IEEE world congress on computational intelligence), Hong Kong, China, 1\u20136 June 2008, pp 2665\u20132670","DOI":"10.1109\/CEC.2008.4631156"},{"key":"438_CR81","doi-asserted-by":"crossref","unstructured":"Tayarani-N M, Akbarzadeh-T M (2008) A sinusoid size ring structure quantum evolutionary algorithm. In: 2008 IEEE conference on cybernetics and intelligent systems, Chengdu, China, 21\u201324 September 2008, pp 1165\u20131170","DOI":"10.1109\/ICCIS.2008.4670952"},{"issue":"4","key":"438_CR82","first-page":"219","volume":"7","author":"MH Tayarani-N","year":"2014","unstructured":"Tayarani-N MH, Akbarzadeh-T MR (2014) Improvement of the performance of the quantum-inspired evolutionary algorithms: structures, population, operators. Evol Intel 7(4):219\u2013239","journal-title":"Evol Intel"},{"issue":"3","key":"438_CR83","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TEVC.2013.2281502","volume":"18","author":"M Tayarani-N","year":"2014","unstructured":"Tayarani-N M, Pr\u00fcgel-Bennett A (2014) On the landscape of combinatorial optimization problems. IEEE Trans Evol Comput 18(3):420\u2013434","journal-title":"IEEE Trans Evol Comput"},{"key":"438_CR84","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.swevo.2015.01.005","volume":"22","author":"M-H Tayarani-N","year":"2015","unstructured":"Tayarani-N M-H, Pr\u00fcgel-Bennett A (2015) Anatomy of the fitness landscape for dense graph-colouring problem. Swarm Evol 22:47\u201365","journal-title":"Swarm Evol"},{"issue":"4","key":"438_CR85","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12065-015-0132-z","volume":"8","author":"M-H Tayarani-N","year":"2015","unstructured":"Tayarani-N M-H, Pr\u00fcgel-Bennett A (2015) Quadratic assignment problem: a landscape analysis. Evol Intel 8(4):165\u2013184","journal-title":"Evol Intel"},{"issue":"2","key":"438_CR86","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1162\/EVCO_a_00154","volume":"24","author":"M-H Tayarani-N","year":"2016","unstructured":"Tayarani-N M-H, Pr\u00fcgel-Bennett A (2016) An analysis of the fitness landscape of travelling salesman problem. Evol Comput 24(2):347\u2013384","journal-title":"Evol Comput"},{"key":"438_CR87","unstructured":"Tsoy Y (2003) The influence of population size and search time limit on genetic algorithm. In: The 7th Korea-Russia international symposium on science and technology, 2003. Proceedings KORUS 2003. vol 3, pp 181\u2013187"},{"key":"438_CR88","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-642-02962-2_63","volume-title":"Rough sets and knowledge technology","author":"H Turabieh","year":"2009","unstructured":"Turabieh H, Abdullah S, McCollum B (2009) Electromagnetism-like mechanism with force decay rate great deluge for the course timetabling problem. In: Wen P, Li Y, Polkowski L, Yao Y, Tsumoto S, Wang G (eds) Rough sets and knowledge technology. Springer, Berlin, pp 497\u2013504"},{"key":"438_CR89","doi-asserted-by":"publisher","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: Yu J, Greco S, Lingras P, Wang G, Skowron A (eds) Rough set and knowledge technology. Springer, Berlin, pp 588\u2013595"},{"issue":"10","key":"438_CR90","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1016\/S0305-0548(02)00083-7","volume":"30","author":"C Valouxis","year":"2003","unstructured":"Valouxis C, Housos E (2003) Constraint programming approach for school timetabling. Comput Oper Res 30(10):1555\u20131572 Part Special Issue: Analytic Hierarchy Process","journal-title":"Comput Oper Res"},{"issue":"4","key":"438_CR91","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1109\/TPWRS.2008.2004743","volume":"23","author":"J Vlachogiannis","year":"2008","unstructured":"Vlachogiannis J, Lee K (2008) Quantum-inspired evolutionary algorithm for real and reactive power dispatch. IEEE Trans Power Syst 23(4):1627\u20131636","journal-title":"IEEE Trans Power Syst"},{"issue":"4","key":"438_CR92","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.neucom.2006.10.001","volume":"70","author":"Y Wang","year":"2007","unstructured":"Wang Y, Feng XY, Huang YX, Pu DB, Zhou WG, Liang YC, Zhou CG (2007) A novel quantum swarm evolutionary algorithm and its applications. Neurocomputing 70(4):633\u2013640","journal-title":"Neurocomputing"},{"issue":"6","key":"438_CR93","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biomet Bull 1(6):80\u201383","journal-title":"Biomet Bull"},{"issue":"11","key":"438_CR94","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1016\/j.camwa.2008.10.021","volume":"57","author":"J Xiao","year":"2009","unstructured":"Xiao J, Xu J, Chen Z, Zhang K, Pan L (2009) A hybrid quantum chaotic swarm evolutionary algorithm for dna encoding. Comput Math Appl 57(11):1949\u20131958","journal-title":"Comput Math Appl"},{"key":"438_CR95","unstructured":"Yang S, Wang M, Jiao L (2004) A novel quantum evolutionary algorithm and its application. In: Congress on evolutionary computation, 2004, CEC2004. vol 1, pp 820\u2013826"},{"key":"438_CR96","doi-asserted-by":"crossref","unstructured":"Yong H (2007) Optimal population size for partheno-genetic algorithm. In: Chinese Control Conference, 2007. CCC 2007, pp 105\u2013106","DOI":"10.1109\/CHICC.2006.4347117"},{"key":"438_CR97","doi-asserted-by":"crossref","unstructured":"You X, Liu S, Shuai D (2006) On parallel immune quantum evolutionary algorithm based on learning mechanism and its convergence. In: Advances in Natural Computation, vol 4221. Lecture Notes in Computer Science. Springer, Berlin, pp 903\u2013912","DOI":"10.1007\/11881070_119"},{"key":"438_CR98","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-58484-6_248","volume-title":"Parallel problem solving from nature\u2014PPSN III, lecture notes in computer science","author":"Y Yukiko","year":"1994","unstructured":"Yukiko Y, Nobue A (1994) A diploid genetic algorithm for preserving population diversity\u2014pseudo-meiosis ga. In: Davidor Y, Schwefel HP, M\u00e4nner R (eds) Parallel problem solving from nature\u2014PPSN III, lecture notes in computer science, vol 866. Springer, Berlin, pp 36\u201345"},{"issue":"3","key":"438_CR99","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.ejor.2009.09.014","volume":"203","author":"D Zhang","year":"2010","unstructured":"Zhang D, Liu Y, M\u2019Hallah R, Leung SC (2010) A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems. Eur J Oper Res 203(3):550\u2013558","journal-title":"Eur J Oper Res"},{"issue":"2","key":"438_CR100","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TSMCB.2003.821456","volume":"34","author":"W Zhong","year":"2004","unstructured":"Zhong W, Liu J, Xue M, Jiao L (2004) A multiagent genetic algorithm for global numerical optimization. IEEE Trans Syst Man Cybern Part B (Cybern) 34(2):1128\u20131141","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"438_CR101","doi-asserted-by":"crossref","unstructured":"Zhou A, Jin Y, Zhang Q, Sendhoff B, Tsang E (2007) Prediction-based population re-initialization for evolutionary dynamic multi-objective optimization. In: Proceedings of the 4th international conference on Evolutionary multi-criterion optimization, EMO\u201907. Springer, Berlin, pp 832\u2013846","DOI":"10.1007\/978-3-540-70928-2_62"},{"key":"438_CR102","doi-asserted-by":"crossref","unstructured":"Zhu K (2003) A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows. In: 15th IEEE International conference on proceedings tools with artificial intelligence, 2003. pp 176\u2013183","DOI":"10.1109\/TAI.2003.1250187"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00438-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-020-00438-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00438-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T22:20:41Z","timestamp":1635200441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-020-00438-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,13]]},"references-count":102,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["438"],"URL":"https:\/\/doi.org\/10.1007\/s12065-020-00438-0","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,13]]},"assertion":[{"value":"19 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}