GOAL solver: a hybrid local search based solver for high school timetabling
| Autor: | Haroldo Gambini Santos, George H. G. Fonseca, Marcone Jamilson Freitas Souza, Samuel Souza Brito, Túlio Ângelo Machado Toffolo |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Mathematical optimization
021103 operations research business.industry Iterated local search Computer science 0211 other engineering and technologies General Decision Sciences 02 engineering and technology Management Science and Operations Research Solver Simulated annealing Theory of computation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Local search (optimization) business Metaheuristic |
| Zdroj: | Annals of Operations Research. 239:77-97 |
| ISSN: | 1572-9338 0254-5330 |
| DOI: | 10.1007/s10479-014-1685-4 |
| Popis: | This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International Timetabling Competition (ITC 2011), which considered many instances from educational institutions around the world and attracted seventeen competitors. Our team, named GOAL (Group of Optimization and Algorithms), developed a solver built upon the Kingston High School Timetabling Engine. Several neighborhood structures were developed and used in a hybrid metaheuristic based on Simulated Annealing and Iterated Local Search. The developed algorithm was the winner of the competition and produced the best known solutions for almost all instances. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink