Journal of the Operational Research Society · 2003 · 23 citations · 22 references
ManagementIndustrial EngineeringOperations ManagementOperations ResearchOptimizationSchedulingGenetic AlgorithmsMulti-objective OptimizationMulti-objective SchedulingMultiobjective OptimizationSchedule OptimizationScheduling OptimizationCycle Time MinimizationEvolutionary Multi-objective SchedulingMulti-objective Evolutionary ComputationMulti-objective Evolutionary OptimizationTimetabling
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 (non-optimal) 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 optimality using a genetic algorithm approach.
22
Genetic algorithms in search, optimization, and machine learning
Choice Reviews Online · 1989 · 49.3K citations
Handbook of critical issues in goal programming
H. Pastijn · European Journal of Operational Research · 1992 · 498 citations