A Multineighbourhood Local Search Solver for the Timetabling Competition TTComp 2002
نویسندگان
چکیده
The International Timetabling Competition 2002 has been organized by the Metaheuristic Network in order to compare different algorithms in a common measurable ground. All information about problem definition, instances, rules, and solution evaluation is available at the webpage http://www.idsia.ch/ Files/ttcomp2002/, and for the sake of brevity we do not repeat them here. We have participated in the competition, and in this abstract, we discuss our solution method, our scores, and we provide some personal comments about the general outcomes.
منابع مشابه
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...
متن کاملAn Automatically Configured Modular Algorithm for Post Enrollment Course Timetabling
Timetabling tasks form a widely studied type of resource scheduling problem, with important real-world applications in schools, universities and other educational settings. In this work, we focus on postenrollment course timetabling, the problem that was covered by Track 2 of the recent 2nd International Timetabling Competition (ITC2007). Following an approach that makes strong use of automated...
متن کاملVariable Neighborhood Search based algorithms for high school timetabling
This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC 2011), which released many instances from educational institutions around the world and attracted seventeen competitors. Some of the VNS algorithm variants were ab...
متن کاملQuikFix A Repair-based Timetable Solver
QuikFix is a software program for solving timetabling problems. The software adapts repair-based heuristic search known in SAT solving to the timetabling domain. A high-level timetabling-specific model enforces structural constraints and allows for meaningful moves in the search space, such as swaps of the time slots or venues of events. QuikFix uses known techniques to improve the search perfo...
متن کاملA Modular Multiphase Heuristic Solver for Post Enrolment Course Timetabling
We give a short description of the solver that ranked third in Track Two of the International Timetabling Competition 2007 (ITC2007). It implements a heuristic approach based on stochastic local search and consists of several modules that were found to be useful in different phases of the solution process. Common to all modules is the consideration of only a subset of the constraints that have ...
متن کامل