{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:18:05Z","timestamp":1763457485759,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T00:00:00Z","timestamp":1440720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this contribution a comparative study of modern heuristics on the school timetabling problem is presented. More precisely, we investigate the application of two population-based algorithms, namely a Particle Swarm Optimization (PSO) and an Artificial Fish Swarm (AFS), on the high school timetabling problem. In order to demonstrate their efficiency and performance, experiments with real-world input data have been performed. Both algorithms proposed manage to create feasible and efficient high school timetables, thus fulfilling adequately the timetabling needs of the respective high schools. Computational results demonstrate that both algorithms manage to reach efficient solutions, most of the times better than existing approaches applied to the same school timetabling input instances using the same evaluation criteria.<\/jats:p>","DOI":"10.3390\/a8030723","type":"journal-article","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T10:55:58Z","timestamp":1441104958000},"page":"723-742","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Comparative Study of Modern Heuristics on the School Timetabling Problem"],"prefix":"10.3390","volume":"8","author":[{"given":"Iosif","family":"Katsaragakis","sequence":"first","affiliation":[{"name":"Department of Business Administration of Food and Agricultural Enterprises,  University of Patras, G. Seferi 2, 30100 Agrinio, Greece"},{"name":"School of Science and Technology, Hellenic Open University, Parodos Aristotelous 18,  26335 Patra, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Tassopoulos","sequence":"additional","affiliation":[{"name":"Department of Business Administration of Food and Agricultural Enterprises,  University of Patras, G. Seferi 2, 30100 Agrinio, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6896-5218","authenticated-orcid":false,"given":"Grigorios","family":"Beligiannis","sequence":"additional","affiliation":[{"name":"Department of Business Administration of Food and Agricultural Enterprises,  University of Patras, G. Seferi 2, 30100 Agrinio, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"ref_1","unstructured":"Cooper, T.B., and Kingston, J.H. (1996). Practice and Theory of Automated Timetabling, Springer Berlin Heidelberg."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/S0377-2217(96)00111-7","article-title":"The combinatorics of timetabling","volume":"96","year":"1997","journal-title":"Eur. J. Op. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/j.ejor.2014.10.043","article-title":"Operational research in education","volume":"243","author":"Johnes","year":"2015","journal-title":"Eur. J. Ope. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1007\/s00500-012-0809-5","article-title":"Using particle swarm optimization to solve effectively the school timetabling problem","volume":"16","author":"Tassopoulos","year":"2012","journal-title":"Soft Comput."},{"key":"ref_5","unstructured":"Pillay, N. (2012, January 28\u201331). Hyper-heuristics for educational timetabling. Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), Son, Norway."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10479-013-1321-8","article-title":"A survey of school timetabling research","volume":"218","author":"Pillay","year":"2014","journal-title":"Ann. Op. Res."},{"key":"ref_7","unstructured":"Kristiansen, S., and Stidsen, T.R. (2013). A Comprehensive Study of Educational Timetabling\u2014A Survey, Technical University of Denmark."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Raghavjee, R., and Pillay, N. (2012, January 5\u20139). A comparison of genetic algorithms and genetic programming in solving the school timetabling problem. Proceedings of the Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC 2012), Mexico City, Mexico.","DOI":"10.1109\/NaBIC.2012.6402246"},{"key":"ref_9","unstructured":"S\u00f8rensen, M., Kristiansen, S., and Stidsen, T.R. (2012, January 28\u201331). International timetabling competition 2011: An adaptive large neighborhood search algorithm. Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), Son, Norway."},{"key":"ref_10","unstructured":"Domr\u00f6s, J., and Homberger, J. (2012, January 28\u201331). An evolutionary algorithm for high school timetabling. Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), Son, Norway."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2279","DOI":"10.1007\/s00500-013-1096-5","article-title":"A greedy gradient-simulated annealing selection hyper-heuristic","volume":"17","author":"Kalender","year":"2013","journal-title":"Soft Comput."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Kheiri, A., \u00d6zcan, E., and Parkes, A.J. (2014). A stochastic local search algorithm with adaptive acceptance for high-school timetabling. Ann. Op. Res.","DOI":"10.1007\/s10479-014-1660-0"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Da Fonseca, G.H.G., Santos, H.G., Toffolo, T.A.M., Brito, S.S., and Souza, M.J.F. (2014). GOAL solver: A hybrid local search based solver for high school timetabling. Ann. Op. Res., 1\u201321.","DOI":"10.1007\/s10479-014-1685-4"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"5463","DOI":"10.1016\/j.eswa.2015.02.059","article-title":"Solving high school timetabling problems worldwide using selection hyper-heuristics","volume":"42","author":"Ahmed","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cor.2015.02.011","article-title":"Mathematical models and algorithms for a high school timetabling problem","volume":"61","author":"Sheralib","year":"2015","journal-title":"Comput. Op. Res."},{"key":"ref_16","unstructured":"Kennedy, J., Eberhart, R.C., and Shi, Y. (2001). Swarm Intelligence, Morgan Kaufmann."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s10462-012-9342-2","article-title":"Artificial fish swarm algorithm: a survey of the state of the art, hybridization, combinatorial and indicative applications","volume":"42","author":"Neshat","year":"2014","journal-title":"Artif. Intell. Rev."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Castro, F., Gelbukh, A., and Mendoza, M.G. (2013). Advances in Soft Computing and Its Applications, Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-45111-9"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/j.ejor.2009.09.014","article-title":"A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems","volume":"203","author":"Zhang","year":"2010","journal-title":"Eur. J. Op. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3472","DOI":"10.1016\/j.asoc.2012.05.029","article-title":"A hybrid particle swarm optimization based algorithm for high school timetabling problems","volume":"12","author":"Tassopoulos","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"6029","DOI":"10.1016\/j.eswa.2011.12.013","article-title":"Solving effectively the school timetabling problem using particle swarm optimization","volume":"39","author":"Tassopoulos","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1057\/palgrave.jors.2602525","article-title":"A Genetic Algorithm Approach to School Timetabling","volume":"60","author":"Beligiannis","year":"2009","journal-title":"J. Op. Res. Soc."},{"key":"ref_23","unstructured":"Dorneles, \u00c1.P., de Ara\u00fajo, O.C.B., and Buriol, L.S. (2012, January 24\u201328). The Impact of compactness requirements on the resolution of high school timetabling problem. Proceedings of the XLIV Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO 2012), Rio de Janeiro, Brazil."},{"key":"ref_24","unstructured":"Rocha, A.M.A.C., Fernandes, E.M.G.P., and Martins, T.F.M.C. (2011). Computational Science and Its Applications (ICCSA 2011), Springer Berlin Heidelberg."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1016\/j.cor.2006.08.010","article-title":"Applying evolutionary computation to the school timetabling problem: The Greek case","volume":"35","author":"Beligiannis","year":"2008","journal-title":"Comput. Op. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"39","DOI":"10.5784\/31-1-158","article-title":"A genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem","volume":"31","author":"Raghavjee","year":"2015","journal-title":"ORiON"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/8\/3\/723\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:47:41Z","timestamp":1760215661000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/8\/3\/723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,28]]},"references-count":26,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2015,9]]}},"alternative-id":["a8030723"],"URL":"https:\/\/doi.org\/10.3390\/a8030723","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2015,8,28]]}}}