A comparative study of modern heuristics on the school timetabling problem

DOI10.3390/A8030723MaRDI QIDQ1736706zbMATH OpenOpenAlexFDO

Authors Iosif V. Katsaragakis, Ioannis X. Tassopoulos, Grigorios N. Beligiannis

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a8030723

zbMATH Keywords

artificial fish swarmparticle swarm optimizationschool timetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: 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.

Recommendations

• Metaheuristics for high school timetabling
• A genetic algorithm approach to school timetabling
• Parallel local search algorithms for high school timetabling problems
• scientific article; zbMATH DE number 1706204
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems

Cites work

• A genetic algorithm approach to school timetabling
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
• A stochastic local search algorithm with adaptive acceptance for high-school timetabling
• A survey of school timetabling research
• Applying evolutionary computation to the school timetabling problem: The Greek case
• GOAL solver: a hybrid local search based solver for high school timetabling
• Mathematical models and algorithms for a high school timetabling problem
• Operational research in education
• The combinatorics of timetabling

Cited in

(2)

• Comparison of neural and heuristic methods for a timetabling problem
• A Fast, Network-based, Hybrid Heuristic for the Assignment of Students to Schools

Describes a project that uses

Uses Software

• GOAL

This page was built for publication: A comparative study of modern heuristics on the school timetabling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736706)