A decomposed metaheuristic approach for a real-world university timetabling problem.
Patrick De CausmaeckerPeter DemeesterGreet Vanden BerghePublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- metaheuristic
- timetabling problem
- hyper heuristics
- memetic algorithm
- tabu search
- simulated annealing
- vehicle routing problem
- ant colony optimization
- combinatorial optimization
- optimization problems
- examination timetabling
- scatter search
- genetic algorithm
- path relinking
- iterated local search
- combinatorial problems
- search space
- combinatorial optimization problems
- optimal solution
- particle swarm optimization
- benchmark instances
- search methods
- nature inspired
- vehicle routing problem with time windows
- graph coloring
- variable neighborhood search
- search procedure
- job shop scheduling problem
- set of benchmark instances
- multi start
- harmony search
- benchmark problems
- heuristic search
- traveling salesman problem
- feasible solution
- heuristic methods
- hybrid metaheuristic
- computational complexity
- guided local search