A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem.
Murat KalenderAhmed KheiriEnder OzcanEdmund K. BurkePublished in: UKCI (2012)
Keyphrases
- hyper heuristics
- timetabling problem
- simulated annealing
- hill climbing
- memetic algorithm
- tabu search
- metaheuristic
- examination timetabling
- evolutionary algorithm
- search procedure
- stochastic search
- graph coloring
- genetic programming
- greedy algorithm
- search algorithm
- genetic algorithm
- cutting stock problems
- benchmark problems
- solution quality
- combinatorial optimization
- search space
- heuristic methods
- genetic algorithm ga
- solution space
- test problems
- feasible solution
- fitness function
- optimization problems
- multi objective
- vehicle routing problem
- job shop scheduling problem
- ant colony optimization
- scheduling problem
- dynamic programming
- scatter search
- differential evolution
- evolutionary computation
- combinatorial problems
- search heuristics
- artificial neural networks
- reinforcement learning