Abstract
The timetabling problem is generally large, highly constrained and discrete in nature. This makes solution by exact optimisation methods difficult. Therefore, often a heuristic search is deemed acceptable providing a simple (nonoptimal) solution. This paper discusses the timetabling problem for a university department, where a large-scale integer goal programming (IGP) formulation is implemented for its efficient optimal solution in two phases. The first phase allocates lectures to rooms and the second allocates start-times to lectures. Owing to the size and complicated nature of the model, an initial analysis procedure is employed to manipulate the data to produce a more manageable model, resulting in considerable reductions in problem size and increase of performance. Both phases are modelled as IGPs. Phase 1 is solved using a state-of-the-art IGP optimisation package. However, due to the scale of the model, phase 2 is solved to optimally using a genetic algorithm approach.
| Original language | English |
|---|---|
| Pages (from-to) | 1155-1166 |
| Number of pages | 12 |
| Journal | Journal of the Operational Research Society |
| Volume | 54 |
| Issue number | 11 |
| DOIs | |
| State | Published - Nov 2003 |
| Externally published | Yes |
Keywords
- Goal programming
- Integer goal programming
- Multi-objective genetic algorithms
- Timetabling
Fingerprint
Dive into the research topics of 'A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver