{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T22:38:33Z","timestamp":1717454313131},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T00:00:00Z","timestamp":1327363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00500-012-0809-5","type":"journal-article","created":{"date-parts":[[2012,1,23]],"date-time":"2012-01-23T00:04:22Z","timestamp":1327277062000},"page":"1229-1252","source":"Crossref","is-referenced-by-count":16,"title":["Using particle swarm optimization to solve effectively the school timetabling problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Ioannis X.","family":"Tassopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigorios N.","family":"Beligiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,24]]},"reference":[{"issue":"10","key":"809_CR1","doi-asserted-by":"crossref","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","journal-title":"Expert Syst Appl"},{"issue":"4","key":"809_CR2","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/TEVC.2006.880326","volume":"13","author":"MR AlRashidi","year":"2009","unstructured":"AlRashidi MR, El-Hawary ME (2009) A survey of particle swarm optimization applications in electric power systems. IEEE Trans Evol Comput 13(4):913\u2013918","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"809_CR3","doi-asserted-by":"crossref","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":"1","key":"809_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1057\/palgrave.jors.2602525","volume":"60","author":"GN Beligiannis","year":"2009","unstructured":"Beligiannis GN, Moschopoulos CN, Likothanassis SD (2009) A genetic algorithm approach to school timetabling. J Oper Res Soc 60(1):23\u201342","journal-title":"J Oper Res Soc"},{"key":"809_CR5","unstructured":"Bilgin B, \u00d6zcan E, Korkmaz EE (2006) An experimental study on hyper-heuristics and exam timetabling. In: Proceedings of the 6th international conference on the practice and theory of automated timetabling, pp 123\u2013140"},{"key":"809_CR6","unstructured":"Brodersen OB (2008) Eignung schwarmintelligenter Verfahren f\u00fcr die betriebliche Entscheidungsunterst\u00fctzung. Cuvillier (in German)"},{"issue":"1\u20134","key":"809_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/B:ANOR.0000030684.30824.08","volume":"129","author":"EK Burke","year":"2004","unstructured":"Burke EK, Newall JP (2004) Solving examination timetabling problems through adaption of heuristic orderings. Ann Oper Res 129(1\u20134):107\u2013134","journal-title":"Ann Oper Res"},{"key":"809_CR8","doi-asserted-by":"crossref","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:266\u2013280","journal-title":"Eur J Oper Res"},{"key":"809_CR9","doi-asserted-by":"crossref","unstructured":"Burke E, Bykov Y, Petrovic S (2001) A multicriteria approach to examination timetabling. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, pp 118\u2013131","DOI":"10.1007\/3-540-44629-X_8"},{"key":"809_CR10","doi-asserted-by":"crossref","unstructured":"Burke EK, MacCarthy B, Petrovic S, Qu R (2001). Case-based reasoning in course timetabling: an attribute graph approach. Lecture Notes in Computer Science, vol 2080. Springer, Berlin, pp 90\u2013104","DOI":"10.1007\/3-540-44593-5_7"},{"issue":"6","key":"809_CR11","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"},{"issue":"6","key":"809_CR12","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1080\/07408170490438410","volume":"36","author":"E Burke","year":"2004","unstructured":"Burke E, Bykov Y, Newall J, Petrovic S (2004) A time-predefined local search approach to exam timetabling problems. IIE Trans 36(6):509\u2013528","journal-title":"IIE Trans"},{"key":"809_CR13","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 graph-based hyper heuristic for educational timetabling problems. Eur J Oper Res 176:177\u2013192","journal-title":"Eur J Oper Res"},{"issue":"3","key":"809_CR14","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.cor.2009.02.023","volume":"37","author":"EK Burke","year":"2010","unstructured":"Burke EK, Mare\u010dek J, Parkes AJ, Rudov\u00e1 H (2010) Decomposition, reformulation, and diving in university course timetabling. Comput Oper Res 37(3):582\u2013597","journal-title":"Comput Oper Res"},{"key":"809_CR15","doi-asserted-by":"crossref","unstructured":"Cambazard H, Demazeau F, Jussien N, David P (2005) Interactively solving school timetabling problems using extensions of constraint programming. Lecture Notes in Computer Science, vol 3616. Springer, Berlin, pp 190\u2013207","DOI":"10.1007\/11593577_12"},{"key":"809_CR16","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1016\/j.cor.2004.08.012","volume":"33","author":"A Chatterjee","year":"2006","unstructured":"Chatterjee A, Siarry P (2006) Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization. Comput Oper Res 33:859\u2013871","journal-title":"Comput Oper Res"},{"key":"809_CR17","unstructured":"Chu S-C, Chen Y-T, Ho J-H (2006) Timetable scheduling using particle swarm optimization. In: Proceedings of the 1st international conference on innovative computing, information and control, pp 324\u2013327"},{"key":"809_CR18","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.compag.2005.08.003","volume":"49","author":"JP Coelho","year":"2005","unstructured":"Coelho JP, de Moura Oliveira PB, Boaventura Cunha J (2005) Greenhouse air temperature predictive control using the particle swarm optimisation algorithm. Comput Electron Agric 49:330\u2013344","journal-title":"Comput Electron Agric"},{"key":"809_CR19","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.asoc.2005.09.004","volume":"7","author":"I Falco De","year":"2007","unstructured":"De Falco I, Della Cioppa A, Tarantino E (2007) Facing classification problems with particle swarm optimization. Appl Soft Comput 7:652\u2013658","journal-title":"Appl Soft Comput"},{"key":"809_CR20","unstructured":"De Haan P, Landman R, Post G, Ruizenaar H (2006) A four-phase approach to a timetabling problem in secondary schools. In: Proceedings of the 6th international conference on the practice and theory of automated timetabling, pp 423\u2013425"},{"key":"809_CR21","doi-asserted-by":"crossref","unstructured":"Di Gaspero L, Schaerf A (2001) Tabu search techniques for examination timetabling. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, pp 104\u2013117","DOI":"10.1007\/3-540-44629-X_7"},{"key":"809_CR22","unstructured":"G\u00fcnther M (2010) Hochflexibles Workforce Management. Herausforderungen und L\u00f6sungsverfahren, Dissertation, TU Ilmenau (in German)"},{"key":"809_CR23","doi-asserted-by":"crossref","unstructured":"G\u00fcnther M, Nissen V (2009) A comparison of neighbourhood topologies for staff scheduling with particle swarm optimisation. In: Mertsching B, Marcus H, Aziz Z (Hrsg): KI 2009: advances in artificial intelligence, 32nd annual conference on AI, 15\u201318 Sept., Paderborn, LNAI 5803. Springer, Berlin, pp 185\u2013192","DOI":"10.1007\/978-3-642-04617-9_24"},{"key":"809_CR24","unstructured":"Jacobsen F, Bortfeldt A, Gehring H (2006) Timetabling at German secondary schools: tabu search versus constraint programming. In: Proceedings of the 6th international conference on the practice and theory of automated timetabling, pp 439\u2013442"},{"key":"809_CR25","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks IV, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"809_CR26","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Morgan Kaufmann Publishers, San Francisco"},{"key":"809_CR27","unstructured":"Kingston JH (2004) A tiling algorithm for high school timetabling. In: Proceedings of the 5th international conference on practice and theory of automated timetabling, pp 233\u2013249"},{"key":"809_CR28","unstructured":"Kingston JH (2006) The KTS high school timetabling system. In: Proceedings of the 6th international conference on the practice and theory of automated timetabling, pp 181\u2013195"},{"key":"809_CR29","unstructured":"McCollum B (2006) University timetabling: bridging the gap between research and practice. In: Proceedings of the 6th international conference on the practice and theory of automated timetabling, pp 15\u201335"},{"key":"809_CR30","doi-asserted-by":"crossref","unstructured":"Nedjah N, de Macedo Mourelle L (2004) Evolutionary time scheduling. In: Proceedings of the international conference on information technology, coding and computing (ITCC\u201904), vol 2, pp 357\u2013361","DOI":"10.1109\/ITCC.2004.1286663"},{"key":"809_CR31","doi-asserted-by":"crossref","unstructured":"Nissen V, G\u00fcnther M, Schumann R (2011) Integrated generation of working time models and staff schedules in workforce management. In: Di Chio C (Hrsg.): Proceedings Evoapplications, 27.-29. Apr., Torino, LNCS 6625, 2. Springer, Berlin, pp 491\u2013500","DOI":"10.1007\/978-3-642-20520-0_50"},{"issue":"3","key":"809_CR32","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1057\/palgrave.jors.2601495","volume":"54","author":"K Papoutsis","year":"2003","unstructured":"Papoutsis K, Valouxis C, Housos E (2003) A column generation approach for the timetabling problem of greek high schools. J Oper Res Soc 54(3):230\u2013238","journal-title":"J Oper Res Soc"},{"issue":"3","key":"809_CR33","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1016\/j.eswa.2006.06.017","volume":"33","author":"S Petrovic","year":"2007","unstructured":"Petrovic S, Yang Y, Dror M (2007) Case-based selection of initialisation heuristics for metaheuristic examination timetabling. Expert Syst Appl 33(3):772\u2013785","journal-title":"Expert Syst Appl"},{"key":"809_CR34","first-page":"1","volume":"2008","author":"R Poli","year":"2008","unstructured":"Poli R (2008) Analysis of the publications on the applications of particle swarm optimisation. J Artif Evol Appl 2008:1\u201310","journal-title":"J Artif Evol Appl"},{"key":"809_CR35","doi-asserted-by":"crossref","unstructured":"Qarouni-Fard D, Najafi-Ardabili A, Moeinzadeh M-H (2007) Finding feasible timetables with particle swarm optimization. In: Proceedings of the 4th international conference on innovations in information technology, pp 387\u2013391","DOI":"10.1109\/IIT.2007.4430422"},{"key":"809_CR36","unstructured":"Qu R, Burke E, McCollum B, Merlot L, Lee S (2006) A survey of search methodologies and automated approaches for examination timetabling, Technical Report No. NOTTCS-TR-2006-4, School of Computer Science and IT, University of Nottingham"},{"key":"809_CR37","doi-asserted-by":"crossref","unstructured":"Ross P, Hart E, Corne D (2003) Genetic algorithms and timetabling. Natural computing series, advances in evolutionary computing: theory and applications, pp 755\u2013777","DOI":"10.1007\/978-3-642-18965-4_30"},{"key":"809_CR38","doi-asserted-by":"crossref","unstructured":"Rossi-Doria O, Sampels M, Birattari M, Chiarandini M, Dorigo M, Gambardella LM et al (2003) A comparison of the performance of different metaheuristics on the timetabling problem. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, pp 329\u2013351","DOI":"10.1007\/978-3-540-45157-0_22"},{"key":"809_CR39","doi-asserted-by":"crossref","unstructured":"Rudova H, Murray K (2003) University course timetabling with soft constraints. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, pp 310\u2013328","DOI":"10.1007\/978-3-540-45157-0_21"},{"key":"809_CR40","doi-asserted-by":"crossref","unstructured":"Schaerf A, Meisels A (2000) Solving employee timetabling problems by generalized local search. Lecture Notes in Computer Science, vol 1792. Springer, Berlin, pp 380\u2013389","DOI":"10.1007\/3-540-46238-4_33"},{"issue":"2","key":"809_CR41","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0360-8352(02)00180-8","volume":"44","author":"KA Smith","year":"2003","unstructured":"Smith KA, Abramson D, Duke D (2003) Hopfield neural networks for timetabling: formulations, methods, and comparative results. Comput Ind Eng 44(2):283\u2013305","journal-title":"Comput Ind Eng"},{"key":"809_CR42","doi-asserted-by":"crossref","unstructured":"Socha K, Knowles J, Sampels M (2002) A MAX\u2013MIN ant system for the university course timetabling problem. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, pp 1\u201313","DOI":"10.1007\/3-540-45724-0_1"},{"key":"809_CR43","doi-asserted-by":"crossref","unstructured":"Ten Eikelder HMM, Willemen RJ (2001). Some complexity aspects of secondary school timetabling problems. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, pp 18\u201327","DOI":"10.1007\/3-540-44629-X_2"},{"key":"809_CR44","doi-asserted-by":"crossref","unstructured":"Trick MA (2001) A schedule-then-break approach to sports timetabling. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, pp 242\u2013253","DOI":"10.1007\/3-540-44629-X_15"},{"issue":"10","key":"809_CR45","doi-asserted-by":"crossref","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","journal-title":"Comput Oper Res"},{"issue":"1","key":"809_CR46","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0957-4174(03)00004-6","volume":"25","author":"Y-Z Wang","year":"2003","unstructured":"Wang Y-Z (2003) Using genetic algorithm methods to solve course scheduling problems. Expert Syst Appl 25(1):39\u201350","journal-title":"Expert Syst Appl"},{"key":"809_CR47","unstructured":"Wren A (1996) Scheduling, timetabling and rostering: a special relationship? Lecture Notes in Computer Science, vol 1153. Springer, Berlin, pp 46\u201375"},{"issue":"1","key":"809_CR48","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.asoc.2009.06.010","volume":"10","author":"Z Xinchao","year":"2010","unstructured":"Xinchao Z (2010) A perturbed particle swarm algorithm for numerical optimization. Appl Soft Comput 10(1):119\u2013124","journal-title":"Appl Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-012-0809-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-012-0809-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-012-0809-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T16:17:41Z","timestamp":1561220261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-012-0809-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,24]]},"references-count":48,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["809"],"URL":"https:\/\/doi.org\/10.1007\/s00500-012-0809-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,24]]}}}