Metaheuristics for High School Timetabling

Authors:
Alberto Colorni;Marco Dorigo;Vittorio Maniezzo
Affiliations:
Centro di Teoria dei Sistemi del CNR, Dipartìmento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy. E-mail: colorni@elet.polimi.it;IRIDIA, Université Libre de Bruxelles, CP 194/6, Avenue Franklin Roosevelt 50, 1050 Bruxelles, Belgium, European Union. http://iridia.ulb.ac.be/dorigo/dorigo.html. E-mail: mdorigo@ulb.ac.be;Scienze dell‘Informazione, Università di Bologna, Contrada Sacchi, 3, 47023 Cesena, Italy. http://www.csr.unibo.it/∼maniezzo. E-mail: maniezzo@csr.unibo.it
Venue:
Computational Optimization and Applications
Year:
1998

Citing 11
Cited 19

A survey of practical applications of examination timetabling algorithms

Operations Research
Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Finding a feasible course schedule using Tabu search

Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
An introduction to population approaches for optimization and hierarchical objective functions: a discussion on the role of tabu search

Annals of Operations Research - Special issue on Tabu search
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Tests on a computer method for constructing school timetables

Communications of the ACM
Parallel Genetic Algorithms Population Genetics and Combinatorial Optimization

Proceedings of the 3rd International Conference on Genetic Algorithms
A Smart Genetic Algorithm for University Timetabling

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Memetic Algorithm for University Exam Timetabling

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Genetic Algorithm Solving a Weekly Course-Timetabling Problem

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling

SchedulExpert: Scheduling Courses in the Cornell University School of Hotel Administration

Interfaces
A Constructive Evolutionary Approach to School Timetabling

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Knowledgesheet: A Graphical Spreadsheet Interface for Interactively Developing a Class of Constraint Programs

PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
A GRASP-tabu search algorithm for solving school timetabling problems

Metaheuristics
University Course Scheduling System (UCSS): a UML application with database and visual programming

Journal of Computing Sciences in Colleges
A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university

Computers and Operations Research
Case-based heuristic selection for timetabling problems

Journal of Scheduling
A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem

Journal of Experimental Algorithmics (JEA)
An application of genetic algorithms to the school timetabling problem

Proceedings of the 2008 annual research conference of the South African Institute of Computer Scientists and Information Technologists on IT research in developing countries: riding the wave of technology
School timetabling for quality student and teacher schedules

Journal of Scheduling
A New Strategy Based on GRASP to Solve a Macro Mine Planning

ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
A perspective on bridging the gap between theory and practice in university timetabling

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Very large-scale neighborhood search techniques in timetabling problems

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A case study for timetabling in a dutch secondary school

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A wide-ranging computational comparison of high-performance graph colouring algorithms

Computers and Operations Research
The Interleaved Constructive Memetic Algorithm and its application to timetabling

Computers and Operations Research
Cyclic transfers in school timetabling

OR Spectrum
Miner ants colony: a new approach to solve a mine planning problem

IDA'05 Proceedings of the 6th international conference on Advances in Intelligent Data Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present the results of an investigation of the possibilities offered by three well-known metaheuristic algorithms to solve the timetable problem, a multi-constrained, NP-hard, combinatorial optimization problem with real-world applications. First, we present our model of the problem, including the definition of a hierarchical structure for the objective function, and of the neighborhood search operators which we apply to matrices representing timetables. Then we report about the outcomes of theutilization of the implemented systems to the specific case of the generation of a school timetable. We compare the results obtained by simulated annealing, tabu search and two versions, with and without local search, of the genetic algorithm. Our results show that GA with local search and tabu search based on temporary problem relaxations both outperform simulated annealing and handmade timetables.