Variable Neighborhood Search Based Algorithm for University Course Timetabling Problem.
Velin KralevRadoslava KralevaPublished in: CoRR (2016)
Keyphrases
- timetabling problem
- memetic algorithm
- dynamic programming
- computational complexity
- objective function
- combinatorial optimization
- np hard
- worst case
- search strategy
- neural network
- particle swarm optimization
- cost function
- optimal solution
- variable neighborhood search
- metaheuristic
- minimum spanning tree
- examination timetabling
- benchmark problems
- computational efficiency
- tabu search
- genetic programming
- genetic algorithm