A GRASP strategy for a more constrained school timetabling problem (Q961453)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A GRASP strategy for a more constrained school timetabling problem |
scientific article |
Statements
A GRASP strategy for a more constrained school timetabling problem (English)
0 references
30 March 2010
0 references
Summary: This work treats a more constrained School Timetabling Problem (STP). It consists of scheduling a set of lectures and teachers in a prefixed period of time, satisfying a set of operational requirements. We applied a Greedy Randomized Adaptive Search Procedure (GRASP) heuristic, combined with a path-relinking improvement. During execution of the GRASP heuristic, the local search procedure interleaves two types of movements. In addition, the path-relinking strategy was itself enhanced by a local search procedure. The algorithms were tested with real instances and proved to be good approaches to solve this problem. Although some restrictions are specific to Brazilian educational institutions, the same ideas can inspire similar approaches for solving the STP in other situations.
0 references
combinatorial optimisation
0 references
greedy randomized adaptive search procedure
0 references
GRASP
0 references
local search
0 references
metaheuristics
0 references
path-relinking
0 references
school timetabling problem
0 references
STP
0 references
scheduling
0 references
Brazil
0 references