A memetic algorithm based on hyper-heuristics for examination timetabling problems.
Yu LeiMaoguo GongLicheng JiaoYi ZuoPublished in: Int. J. Intell. Comput. Cybern. (2015)
Keyphrases
- timetabling problem
- memetic algorithm
- hyper heuristics
- examination timetabling
- tabu search
- graph coloring
- evolutionary computation
- genetic algorithm
- job shop scheduling problem
- cutting stock problems
- condition action rules
- vehicle routing problem
- crossover operator
- metaheuristic
- learning algorithm
- np hard
- special case