A User-Friendly Evolutionary Tool for High-School Timetabling

2008 ◽  
pp. 149-162 ◽  
Author(s):  
Charalampos N. Moschopoulos ◽  
Christos E. Alexakos ◽  
Christina Dosi ◽  
Grigorios N. Beligiannis ◽  
Spiridon D. Likothanassis
Keyword(s):  
High School ◽  
High School Timetabling ◽  
School Timetabling ◽  
User Friendly

A computational study of local search algorithms for Italian high-school timetabling

2007 ◽  
Vol 13 (6) ◽  
pp. 543-556 ◽  
Author(s):  
Pasquale Avella ◽  
Bernardo D’Auria ◽  
Saverio Salerno ◽  
Igor Vasil’ev
Keyword(s):  
High School ◽  
Local Search ◽  
Computational Study ◽  
Search Algorithms ◽  
Local Search Algorithms ◽  
High School Timetabling ◽  
School Timetabling

scholarly journals A Two Stage Approach for High School Timetabling

2013 ◽  
pp. 66-73 ◽  
Author(s):  
Moh’d Khaled Yousef Shambour ◽  
Ahamad Tajudin Khader ◽  
Ahmed Kheiri ◽  
Ender Özcan
Keyword(s):  
High School ◽  
Two Stage ◽  
High School Timetabling ◽  
School Timetabling

Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems

2020 ◽  
Vol 280 (3) ◽  
pp. 1064-1081 ◽  
Author(s):  
Landir Saviniec ◽  
Maristela O. Santos ◽  
Alysson M. Costa ◽  
Lana M.R. dos Santos
Keyword(s):  
High School ◽  
High School Timetabling ◽  
School Timetabling

scholarly journals Solving high school timetabling problems worldwide using selection hyper-heuristics

2015 ◽  
Vol 42 (13) ◽  
pp. 5463-5471 ◽  
Author(s):  
Leena N. Ahmed ◽  
Ender Özcan ◽  
Ahmed Kheiri
Keyword(s):  
High School ◽  
High School Timetabling ◽  
School Timetabling

Late acceptance hill-climbing for high school timetabling

2015 ◽  
Vol 19 (4) ◽  
pp. 453-465 ◽  
Author(s):  
George H. G. Fonseca ◽  
Haroldo G. Santos ◽  
Eduardo G. Carrano
Keyword(s):  
High School ◽  
Hill Climbing ◽  
High School Timetabling ◽  
School Timetabling ◽  
Late Acceptance Hill Climbing

scholarly journals A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems

2017 ◽  
Vol 25 (3) ◽  
pp. 473-501 ◽  
Author(s):  
Ahmed Kheiri ◽  
Ed Keedwell
Keyword(s):  
High School ◽  
Operations Research ◽  
Research Problem ◽  
Research Problems ◽  
High School Timetabling ◽  
School Timetabling ◽  
School Timetabling Problem ◽  
Computational Systems ◽  
Model Approach

Operations research is a well-established field that uses computational systems to support decisions in business and public life. Good solutions to operations research problems can make a large difference to the efficient running of businesses and organisations and so the field often searches for new methods to improve these solutions. The high school timetabling problem is an example of an operations research problem and is a challenging task which requires assigning events and resources to time slots subject to a set of constraints. In this article, a new sequence-based selection hyper-heuristic is presented that produces excellent results on a suite of high school timetabling problems. In this study, we present an easy-to-implement, easy-to-maintain, and effective sequence-based selection hyper-heuristic to solve high school timetabling problems using a benchmark of unified real-world instances collected from different countries. We show that with sequence-based methods, it is possible to discover new best known solutions for a number of the problems in the timetabling domain. Through this investigation, the usefulness of sequence-based selection hyper-heuristics has been demonstrated and the capability of these methods has been shown to exceed the state of the art.

Effective local search algorithms for high school timetabling problems

2017 ◽  
Vol 60 ◽  
pp. 363-373 ◽  
Author(s):  
Landir Saviniec ◽  
Ademir Aparecido Constantino
Keyword(s):  
High School ◽  
Local Search ◽  
Search Algorithms ◽  
Local Search Algorithms ◽  
High School Timetabling ◽  
School Timetabling
Sign in / Sign up

Export Citation Format

Share Document