Variable Neighborhood Search for a Real-World Curriculum-Based University Timetabling Problem.
Khang NguyenQuang NguyenHien TranPhuc NguyenNuong TranPublished in: KSE (2011)
Keyphrases
- timetabling problem
- variable neighborhood search
- memetic algorithm
- benchmark instances
- tabu search
- metaheuristic
- vehicle routing problem
- examination timetabling
- hyper heuristics
- heuristic methods
- hybrid method
- traveling salesman problem
- routing problem
- genetic algorithm
- minimum spanning tree
- job shop scheduling problem
- search procedure
- combinatorial optimization
- simulated annealing
- path relinking
- scheduling problem
- optimal solution