Towards a Deterministic Algorithm for the International Timetabling Competition
نویسندگان
چکیده
The Course Timetabling Problem consists of the weekly scheduling of lectures of a collection of university courses, subject to certain constraints. The International Timetabling Competitions, ITC-2002 and ITC-2007, have been organized with the aim of creating a common formulation for comparison of solution proposals. This paper discusses the design and implementation of an extendable family of sorting-based mechanisms, called Sort Then Fix (STF) algorithms. Only ITC-2002 problem instances were used in this study. The STF approach is deterministic, and does not require swapping or backtracking. Almost all solutions run in less than 10% of the ITC-2002 benchmark time.
منابع مشابه
Towards the Benchmarks for Scheduling Problems
The aim of this paper is not to offer any definite proposal for the scheduling competition, but to discuss some of the key issues to be considered in such an endeavour. The discussion will refer to three types of scheduling problems: production scheduling, employee scheduling (the discussion will be focused on nurse rostering being a very complex and highly constrained scheduling problem) and u...
متن کاملInternational Timetabling Competition A Hybrid Approach
This work arises from the research of the Metaheuristics Network on the University Course Timetabling Problem. In a first phase straightforward implementations of different metaheuristics were compared on a common local search framework [4]. In a second phase problem specific knoweldge was exploited and several alternatives for local search and metaheuristics were considered. Many possibilities...
متن کاملA time-dependent metaheuristic algorithm for post enrolment-based course timetabling
Ametaheuristic-based algorithm is presented for the post enrolment-based course timetabling problem used in track-2 of the Second International Timetabling Competition (ITC2007). The featured algorithm operates in three distinct stages – a constructive phase followed by two separate phases of simulated annealing – and is time dependent, due to the fact that various run-time parameters are calcu...
متن کاملGOAL solver: a hybrid local search based solver for high school timetabling
This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International Timetabling Competition (ITC 2011), which considered many instances from educational institutions around the world and attracted seventeen competitors. Our team, named GOAL (Group of Optimization and Algorithms), developed a solver built...
متن کاملThe Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling
Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timet...
متن کامل