A Constructive Evolutionary Approach to School Timetabling
نویسندگان
چکیده
This work presents a constructive approach to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. The problem is modeled as a bi-objective problem used as a basis to construct feasible assignments of teachers to classes on specified timeslots. A new representation for the timetabling problem is presented. Pairs of teachers and classes are used to form conflict-free clusters for each timeslot. Teacher preferences and the process of avoiding undesirable waiting times between classes are explicitly considered as additional objectives. Computational results over real test problems are presented.
منابع مشابه
A discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملAn Evolutionary Approach to the School Timetabling Problem
We present a general heuristic technique that solves a timetabling problem, such as school timetabling. It is based on a Hopfield-type neural network, whose complexity was significantly reduced by incorporating a genetic algorithm into a very first stage of the timetabling process. The goal of the GA was to initialize the network so that the number of neurons and their connections decreased, an...
متن کاملThe Interleaved Constructive Memetic Algorithm and its application to timetabling
Timetabling problems are well known NP-hard constraint satisfaction, and real-world cases often have complicated and challenging structures. For such problems, we present a new hybrid method, “Interleaved Constructive Memetic Algorithm” (ICMA) that interleaves memetic algorithms with constructive methods. ICMA works using an active subset of all the events. Starting with a few events, in multip...
متن کاملA Non-standard Genetic Algorithm Approach to Solve Constrained School Timetabling Problems
In this paper a non-standard constructive approach is described to solve problems of timetabling, so necessary in every school and university. Genetic Algorithms have been used, but adapting them to the characteristics of the problem under consideration. Hard constrains, feasible timetables, have been considered in the problem formulation, forcing us to define a particular population generation...
متن کاملAutomated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hybrid approach. On the one hand an evolutionary algorithm searches the space of all permutations of the events from which a timetable builder generates the school timetables. Those timetables are further optimized by lo...
متن کامل