Title | ||
---|---|---|
Variable Neighborhood Search for a Real-World Curriculum-Based University Timetabling Problem |
Abstract | ||
---|---|---|
This paper presents the application of Variable Neighborhood Search algorithm and seven of its variants on a real-world highly constrained curriculum-based university course timetabling problem. Experimental results on 14 instances taken from practice are shown and some conclusions about the efficiency of these algorithms on the considered problem are drawn. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/KSE.2011.31 | KSE |
Keywords | Field | DocType |
variable neighborhood search algorithm,curriculum-based university course,considered problem,real-world curriculum-based university timetabling,metaheuristics | Variable neighborhood search,Computer science,Curriculum,Artificial intelligence,Timetabling problem,Machine learning,Metaheuristic | Conference |
Citations | PageRank | References |
1 | 0.36 | 10 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Khang Nguyen | 1 | 2 | 1.09 |
Quang Nguyen | 2 | 9 | 1.87 |
Hien Tran | 3 | 4 | 1.41 |
Phuc Nguyen | 4 | 1 | 0.70 |
Nuong Tran | 5 | 1 | 0.70 |