A Comparative Study of Modern Heuristics on the School Timetabling Problem
AbstractIn 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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Katsaragakis, I.V.; Tassopoulos, I.X.; Beligiannis, G.N. A Comparative Study of Modern Heuristics on the School Timetabling Problem. Algorithms 2015, 8, 723-742.
Katsaragakis IV, Tassopoulos IX, Beligiannis GN. A Comparative Study of Modern Heuristics on the School Timetabling Problem. Algorithms. 2015; 8(3):723-742.Chicago/Turabian Style
Katsaragakis, Iosif V.; Tassopoulos, Ioannis X.; Beligiannis, Grigorios N. 2015. "A Comparative Study of Modern Heuristics on the School Timetabling Problem." Algorithms 8, no. 3: 723-742.