An XML format for benchmarks in High School Timetabling

Post, Gerhard F.; Ahmadi, Samad; Daskalaki, Sophia; Kingston, Jeffrey H.; Kyngäs, Jari; Nurmi, Cimmo; Ranson, David

doi:10.1007/s10479-010-0699-9

Cited by 60 publications

(50 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the different education systems and constraints imposed by different educational institutions, a group of researchers (Post et al, 2012) has proposed a unified high school timetabling format that fits with the different education systems across the world. To encourage scientists and practitioners to provide solution methods for high school timetabling problem, an international timetabling competition (ITC 2011) (Post et al, 2013) using the unified benchmark instances collected from over 10 countries was organised.…”

Section: High School Timetabling Benchmarkmentioning

confidence: 99%

See 1 more Smart Citation

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

Kheiri

Keedwell

2017

Evolutionary Computation

View full text Add to dashboard Cite

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 paper 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-theart.

show abstract

Section: High School Timetabling Benchmarkmentioning

confidence: 99%

“…Table 1 Due to space restrictions, we only provided a brief description of the studied problem. For a full description of the problem, the reader is directed to (Post et al, 2012(Post et al, , 2013.…”

Section: High School Timetabling Benchmarkmentioning

confidence: 99%

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

Kheiri

Keedwell

2017

Evolutionary Computation

View full text Add to dashboard Cite

show abstract

“…High school timetabling, for example, restricts the workload of a resource (e.g. student, teacher or room) by a minimum and maximum value [105].…”

Section: Contributionsmentioning

confidence: 99%

Nurse rostering: models and algorithms for theory, practice and integration with other problems

Smet

2016

4OR-Q J Oper Res

View full text Add to dashboard Cite

“…With the introduction of the XHSTT format (Post et al, 2012a), a large number of instances from various origins became publicly available in standardized form. The format is based on the Extensible Markup Language (XML) standard, and all instances are available online (Post, 2013a).…”

Section: Integer Programming 1 Introductionmentioning

confidence: 99%

Integer programming for the generalized high school timetabling problem

Kristiansen

Sørensen

Stidsen

2014

J Sched

View full text Add to dashboard Cite

Recently the XHSTT format for (High) School Timetabling was introduced, which provides a uniform way of modeling problem instances and corresponding solutions. The format supports a big variety of constraints, and currently 38 real-life instances from 11 dierent countries are available. Thereby the XHSTT format serves as a common ground for researchers within this area. This paper describes the rst exact method capable of handling an arbitrary instance of the XHSTT format. The method is based on a Mixed-Integer linear Programming (MIP) model, which is solved in two steps with a commercial generalpurpose MIP solver. Computational results show that our approach is able to nd previously unknown optimal solutions for 2 instances of XHSTT, and proves optimality of 4 known solutions. For the instances not solved to optimality, new non-trivial lower bounds were found in 11 cases, and new best-known solutions were found in 9 cases. Furthermore the approach is shown to be competitive with the nalist of Round 2 of the International Timetabling Competition 2011.

show abstract

An XML format for benchmarks in High School Timetabling

Cited by 60 publications

References 25 publications

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

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

Nurse rostering: models and algorithms for theory, practice and integration with other problems

Integer programming for the generalized high school timetabling problem

Contact Info

Product

Resources

About