|
|||||
|
|
Variable Neighborhood Search based algorithms for high school timetabling |
|
| Affiliation: | 1. Department of Management Engineering, Technical University of Denmark, Denmark;2. MaCom A/S, Copenhagen, Denmark;1. Sabancı University, School of Management, Orhanlı Tuzla, İstanbul, 34956, Turkey;2. Fatih Sultan Mehmet University, Department of Computer Science, Haliç Campus, Beyoğlu, İstanbul, 34445, Turkey;1. ISEL – Instituto Superior de Engenharia de Lisboa, Instituto Politécnico de Lisboa, Rua Conselheiro Emídio Navarro, n.° 1, Lisboa 1959-007, Portugal;2. LARSyS: Laboratory for Robotics and Systems in Engineering and Science, Universidade de Lisboa, Av. Rovisco Pais, n.° 1, Lisboa 1049-001, Portugal;3. Department of Bioengineering/Instituto Superior Técnico, Universidade de Lisboa, Av. Rovisco Pais, n.° 1, Lisboa 1049-001, Portugal;1. Instituto de Informática, Universidade Federal do Rio Grande do Sul, 91501-970 Porto Alegre, RS, Brazil;2. Colégio Técnico Industrial de Santa Maria, Universidade Federal de Santa Maria, 97105-900 Santa Maria, RS, Brazil |
| Abstract: | This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC 2011), which released many instances from educational institutions around the world and attracted 17 competitors. Some of the VNS algorithm variants were able to outperform the winner of Third ITC solver, which proposed a Simulated Annealing – Iterated local Search approach. This result coupled with another reports in the literature points that VNS based algorithms are a practical solution method for providing high quality solutions for some hard timetabling problems. Moreover they are easy to implement with few parameters to adjust. |
| Keywords: | Variable Neighborhood Search High School Timetabling Problem Third International Timetabling Competition |
| 本文献已被 ScienceDirect 等数据库收录！ | |