SAT-Based Approaches for the General High School Timetabling Problem

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence ◽

10.24963/ijcai.2017/747 ◽

2017 ◽

Author(s):

Emir Demirović

Keyword(s):

High School ◽

Metaheuristic Algorithms ◽

Modeling Techniques ◽

High School Timetabling ◽

Research Goal ◽

School Timetabling ◽

School Timetabling Problem ◽

Future Work ◽

The Relationship

High School Timetabling (HSTT) is a well known and widespread problem. It consists of coordinating resources (e.g. teachers, rooms), times, and events (e.g. lectures) with respect to various constraints. In this paper, I summarize the work I have done towards exploring the relationship between propositional logic and HSTT. This includes various modeling techniques in the form of maxSAT and bitvectors, data structures for local search algorithms, and the combination of maxSAT and metaheuristic algorithms. In addition, I discuss possible directions for future work as a part of a long-term research goal to combine complete and metaheuristic algorithms.

Download Full-text

A Simulated Annealing Based Approach to the High School Timetabling Problem

Intelligent Data Engineering and Automated Learning - IDEAL 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32639-4_66 ◽

2012 ◽

pp. 540-549 ◽

Cited By ~ 3

Author(s):

George H. G. Fonseca ◽

Samuel S. Brito ◽

Haroldo G. Santos

Keyword(s):

High School ◽

Simulated Annealing ◽

Timetabling Problem ◽

High School Timetabling ◽

School Timetabling ◽

School Timetabling Problem

Download Full-text

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

Evolutionary Computation ◽

10.1162/evco_a_00186 ◽

2017 ◽

Vol 25 (3) ◽

pp. 473-501 ◽

Cited By ~ 15

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.

Download Full-text