We discuss the High School Timetabling Problem as it appears in different countries. Based on this discussion, we propose a data model for exchanging datasets. The data model is defined by an xml schema, which is available online 1 .
This paper is the organizers' report on the Third International Timetabling Competition (ITC2011), run during the first half of 2012. Its participants tackled 35 instances of the high school timetabling problem, taken from schools in 10 countries.
One hundred eighty male managers participated as age-homogeneous 4-person teams in a validated all-day decision-making simulation. Fifteen teams consisted of 28- to 35-year-old participants (young), 15 teams were in the 45-55 age range (middle-aged), and 15 teams consisted of 65- to 75-year-old (older) persons. More than 40 objective performance measures… (More)
We present the progress on the benchmarking project for high school timetabling that was introduced at PATAT 2008. In particular, we announce the High School Timetabling Archive XHSTT-2011 with 21 instances from 8 countries and an evaluator capable of checking the syntax of instances and evaluating the solutions.
In this paper we propose a neighbourhood structure based on sequential/cyclic moves and a Cyclic Transfer algorithm for the high school timetabling problem. This method enables execution of complex moves for improving an existing solution, while dealing with the challenge of exploring the neighbourhood efficiently. An improvement graph is used in which… (More)
We study finite-dimensional Lie algebras of polynomial vector fields in n variables that contain the vector fields ∂ ∂x i x 1 ∂ ∂x 1 + · · · + x n ∂ ∂x n. We derive some general results on the structure of such Lie algebras, and provide the complete classification in the cases n = 2 and n = 3. Finally we describe a certain construction in high dimensions.… (More)
We study finite-dimensional Lie algebras L of polynomial vector fields in n variables that contain the vector fields ∂ ∂x i and x 1 ∂ ∂x 1 + · · · + x n ∂ ∂x n. We show that the maximal ones always contain a semi-simple subalgebra ¯ g, such that ∂ ∂x i ∈ ¯ g (i = 1,. .. , m) for an m with 1 ≤ m ≤ n. Moreover a maximal algebra has no trivial ¯ g-module in… (More)
The VeRoLog Solver Challenge 2016–2017 is the third solver challenge facilitated by VeRoLog, the EURO Working Group on Vehicle Routing and Logistics Optimization, and is organized in cooperation with ORTEC B.V. The authors constitute the organizing committee of this challenge, and with this paper they report on the problem and organization of this challenge.