Name
Abstract | ||
|---|---|---|
•We propose Iterated Local Search and Variable Neighborhood Search based algorithms for high school timetabling problems.•We devise two generic neighborhood operators that can be easily adapted to similar problems.•The hybridization between these neighborhood operators improves hugely the effectiveness of local search procedures.•The proposed algorithms outperform state-of-the-art approaches in two datasets tested for two variants of the problem.•New instances collected from different Brazilian high schools are made available for next studies. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.asoc.2017.06.047 | Applied Soft Computing |
Keywords | Field | DocType |
Class–teacher timetabling,Iterated Local Search,Variable Neighborhood Search,Minimum Cost Assignment Problem,Conflict graph | Guided Local Search,Variable neighborhood search,Artificial intelligence,Soft computing,Iterated local search,Metaheuristic,Mathematical optimization,Algorithm,Local search (optimization),Combinatorial search,Timetabling problem,Mathematics,Machine learning | Journal |
Volume | ISSN | Citations |
60 | 1568-4946 | 5 |
PageRank | References | Authors |
0.46 | 26 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Landir Saviniec | 1 | 5 | 0.46 |
| Ademir Aparecido Constantino | 2 | 15 | 5.76 |